[go: up one dir, main page]

CN111915150B - A planning method for electric bus system - Google Patents

A planning method for electric bus system Download PDF

Info

Publication number
CN111915150B
CN111915150B CN202010663544.1A CN202010663544A CN111915150B CN 111915150 B CN111915150 B CN 111915150B CN 202010663544 A CN202010663544 A CN 202010663544A CN 111915150 B CN111915150 B CN 111915150B
Authority
CN
China
Prior art keywords
charging
electric bus
electric
shift
scheduling
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
CN202010663544.1A
Other languages
Chinese (zh)
Other versions
CN111915150A (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.)
Tongji University
Original Assignee
Tongji University
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 Tongji University filed Critical Tongji University
Priority to CN202010663544.1A priority Critical patent/CN111915150B/en
Publication of CN111915150A publication Critical patent/CN111915150A/en
Application granted granted Critical
Publication of CN111915150B publication Critical patent/CN111915150B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/12Computing arrangements based on biological models using genetic models
    • G06N3/126Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/06Energy or water supply
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/40Business processes related to the transportation industry
    • 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biophysics (AREA)
  • General Health & Medical Sciences (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Educational Administration (AREA)
  • Evolutionary Biology (AREA)
  • Primary Health Care (AREA)
  • Development Economics (AREA)
  • Computational Linguistics (AREA)
  • Computing Systems (AREA)
  • Artificial Intelligence (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Genetics & Genomics (AREA)
  • Molecular Biology (AREA)
  • Biomedical Technology (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • Physiology (AREA)
  • Charge And Discharge Circuits For Batteries Or The Like (AREA)

Abstract

本发明涉及一种电动公交系统规划方法,包括以下步骤:获取公交线网信息和费用信息;利用公交线网信息和费用信息,建立以电动公交系统总成本最小为目标的电动公交线网运营调度及充电设施布设优化模型;利用连续变化交叉概率和连续变化变异概率的自适应遗传算法求解电动公交线网运营调度及充电设施布设优化模型,得到涉及电动公交线网运营调度和电动公交充电设施布设的电动公交系统。与现有技术相比,同时优化了电动公交运营调度计划与充电设施布设方案,可适用于分时电价,提高电动公交车辆的利用率,电动公交充电调度更为灵活,可实现错峰充电,减少用电费用,提高电动公交车辆和充电设施的利用率。

The invention relates to a planning method for an electric public transport system, comprising the following steps: acquiring public transport network information and cost information; using the public transport network information and cost information to establish an electric public transport network operation scheduling with the goal of minimizing the total cost of the electric public transport system and the optimization model of charging facility layout; using the adaptive genetic algorithm of continuously changing crossover probability and continuously changing variation probability to solve the optimization model of electric bus network operation scheduling and charging facility layout, and obtain the optimal model involving electric bus network operation scheduling and electric bus charging facility layout electric bus system. Compared with the existing technology, the electric bus operation scheduling plan and the charging facility layout plan are optimized at the same time, which can be applied to the time-of-use electricity price, improve the utilization rate of electric bus vehicles, and the charging scheduling of electric buses is more flexible, which can realize off-peak charging. Reduce electricity costs and increase the utilization of electric buses and charging facilities.

Description

一种电动公交系统规划方法A planning method for electric bus system

技术领域technical field

本发明涉及公交系统领域,尤其是涉及一种电动公交系统规划方法。The invention relates to the field of public transport systems, in particular to an electric public transport system planning method.

背景技术Background technique

公交系统由于线路、时刻表固定,是纯电动汽车的理想应用场景之一。电动公交车具有低噪音、零排放、舒适性高等特点,被普遍认为将替代传统的柴油公交车,是公交系统未来的发展方向。The bus system is one of the ideal application scenarios for pure electric vehicles due to its fixed routes and timetables. Electric buses have the characteristics of low noise, zero emissions, and high comfort. They are generally considered to replace traditional diesel buses and are the future development direction of the public transportation system.

然而,由于电池技术的限制,电动公交车续航能力有限、充电时间较长,电动公交车的运营调度不仅需要考虑车辆的排班调度,还需要考虑车辆的充电调度。此外,充电设施布局问题也是公交电动化的重点难题,且充电设施布局与电动公交车运营调度之间互相影响,因此,同时优化这两个方面是公交电动化的关键技术难点。However, due to the limitations of battery technology, electric buses have limited battery life and long charging time. The operation and scheduling of electric buses need to consider not only the scheduling of vehicles, but also the scheduling of charging vehicles. In addition, the layout of charging facilities is also a key problem in the electrification of public transport, and the layout of charging facilities and the operation and scheduling of electric buses affect each other. Therefore, optimizing these two aspects at the same time is a key technical difficulty in electrification of public transport.

现已有分别单独针对电动公交运营调度和充电设施布局的研究。电动公交运营调度方面,中国专利CN 107341563、CN 104615850和CN 109636176研究了单一充电站的电动公交车辆充电顺序计划,专利CN 109934391基于车辆排班问题(Vehicle SchedulingProblem,VSP),通过启发式算法减少车辆使用数,专利CN 109615268进一步考虑到分时电价场景,以车辆当天充电费用最小为目标建立车辆运营调度模型。另一方面,专利CN110705745和CN 107392360等则从充电站的选址定容和充电设施数量设置等方面对电动公交充电设施布局建模优化提供了经验借鉴。There have been separate studies on electric bus operation scheduling and charging facility layout. In terms of electric bus operation scheduling, Chinese patents CN 107341563, CN 104615850 and CN 109636176 have studied the electric bus charging sequence plan of a single charging station, and patent CN 109934391 is based on the vehicle scheduling problem (Vehicle SchedulingProblem, VSP), and the number of vehicles is reduced by a heuristic algorithm. The number of usage, the patent CN 109615268 further considers the time-of-use electricity price scenario, and establishes a vehicle operation scheduling model with the goal of minimizing the charging cost of the vehicle on the day. On the other hand, patents such as CN110705745 and CN 107392360 provide experience and reference for modeling and optimizing the layout of electric bus charging facilities from the aspects of the location and capacity of the charging station and the setting of the number of charging facilities.

但是,电动公交运营调度与充电设施布设同步优化技术研究尚且欠缺。而且,目前对于电动公交排班调度的研究多基于单车场单线路场景,缺乏对多车场多线路场景的考虑。另外,当前研究多默认使用充电即充满的充电方式,缺少对更加灵活的部分充电方式的建模优化。However, the research on the synchronous optimization technology of electric bus operation scheduling and charging facility layout is still lacking. Moreover, the current research on electric bus scheduling is mostly based on the single-line scenario of a single-park, and lacks consideration of the multi-line scenario with multiple yards. In addition, the current research mostly uses the default charging method of charging and charging, and lacks modeling optimization for more flexible partial charging methods.

发明内容Contents of the invention

本发明的目的就是为了克服上述现有技术存在的缺陷而提供一种电动公交系统规划方法。The object of the present invention is to provide an electric bus system planning method in order to overcome the above-mentioned defects in the prior art.

本发明的目的可以通过以下技术方案来实现:The purpose of the present invention can be achieved through the following technical solutions:

一种电动公交系统规划方法,该方法包括以下步骤:A method for planning an electric public transport system, the method comprising the following steps:

步骤S1:获取公交线网信息和费用信息,所述公交线网信息包括公交线网站点信息、站点间空驶时长信息以及线路运营时刻表信息,所述公交线网站点信息包括线网中各条线路首末站的车位数、配建设施以及电网条件;Step S1: Obtain bus network information and cost information. The bus network information includes bus line site information, inter-stop idling time information, and line operation timetable information. The bus line site information includes each item in the network. The number of parking spaces, supporting facilities and power grid conditions at the first and last stations of the line;

步骤S2:利用公交线网信息和费用信息,建立以电动公交系统总成本最小为目标的电动公交线网运营调度及充电设施布设优化模型;Step S2: Using the bus network information and cost information, establish an electric bus network operation scheduling and charging facility layout optimization model with the goal of minimizing the total cost of the electric bus system;

步骤S3:利用连续变化交叉概率和连续变化变异概率的自适应遗传算法求解电动公交线网运营调度及充电设施布设优化模型,得到涉及电动公交线网运营调度和电动公交充电设施布设的电动公交系统。Step S3: Use the adaptive genetic algorithm of continuously changing crossover probability and continuously changing mutation probability to solve the optimization model of electric bus network operation scheduling and charging facility layout, and obtain the electric bus system involving electric bus network operation scheduling and electric bus charging facility layout .

所述费用信息包括电价收费标准,所述的电价收费标准包括单一电价收费标准和分时电价收费标准。The fee information includes an electricity price charging standard, and the electricity price charging standard includes a single electricity price charging standard and a time-of-use electricity charging standard.

所述电动公交线网运营调度及充电设施布设优化模型的目标函数为:The objective function of the electric bus line network operation scheduling and charging facility layout optimization model is:

其中,Z是电动公交系统总成本,由电动公交购置成本、电动公交充电设施购置成本、电费成本以及电动公交运营成本四个部分组成;cb为电动公交车单辆购置成本,cc为充电设施单个购置成本,ce为电价,ct为电动公交每小时运营成本,ei为班次i消耗的电量,ti为班次i的运营时长,Eij为班次j开始时与班次i结束时相比的电池电量变化量,Tij为车辆从班次i结束到到达班次j起点站所需的时长;xij在电动公交车辆在班次i运营结束后运营班次j时取1,否则取0;ypq为充电桩在充电事件p结束后执行充电事件q时取1,否则取0。Among them, Z is the total cost of the electric bus system, which is composed of four parts: electric bus purchase cost, electric bus charging facility purchase cost, electricity cost, and electric bus operation cost; c b is the purchase cost of a single electric bus, and c c is the charging cost Single purchase cost of facility, c e is the electricity price, c t is the operating cost of electric bus per hour, e i is the electricity consumption of shift i, t i is the operation time of shift i, E ij is the start time of shift j and the end time of shift i Compared with the change in battery power, T ij is the time required for the vehicle to arrive at the starting point of shift j from the end of shift i; x ij takes 1 when the electric bus operates shift j after shift i ends, and takes 0 otherwise; y pq is 1 when the charging pile executes the charging event q after the charging event p is completed, otherwise it is 0.

所述电动公交线网运营调度及充电设施布设优化模型的约束条件包括:The constraints of the electric bus line network operation scheduling and charging facility layout optimization model include:

车辆排班约束:Vehicle scheduling constraints:

电量消耗约束:Power Consumption Constraints:

充电排班约束:Charging schedule constraints:

Eij、Tij和lp的计算公式为:The calculation formulas of E ij , T ij and l p are:

其中,i,j为班次或首末站的编号,S为所有公交班次的集合,D为所有首末站的集合,U为S和D的并集,p、q为充电事件或首末站的编号,P为所有充电事件的集合,Q为P和D的并集;ai为班次i的开始时间,li为班次i结束后车辆的剩余电量;SOCmax,SOCmin为预先设定的电池电量上下限;zip在电动公交车运营班次i结束后进行充电事件p时取1,否则取0,zpj在电动公交车进行充电事件p后运营班次j时取1,否则取0;ap为充电事件p的开始时间,tp为充电事件p的充电时长,lp为充电事件p开始前电动公交车的剩余电量;eip为电动公交车运营班次i结束后行驶到充电事件p所在充电站所消耗的电量,epj为电动公交车在充电事件p结束后行驶到班次j起点站所消耗的电量,tip为电动公交车运营班次i结束后行驶到充电事件p所在充电站所所消耗的时间,tpj为电动公交车在充电事件p结束后行驶到班次j起点站所消耗的时间;tij为电动公交车从班次i终点站行驶到班次j起点站所消耗的时间,eij电动公交车从班次i终点站行驶到班次j起点站所消耗的电量;M为一足够大的数;F(lp,tp)为充电函数,以lp和tp为自变量,因变量为充电事件p结束后电动公交的剩余电量。Among them, i, j are the number of the shift or the first and last station, S is the collection of all bus trips, D is the collection of all the first and last stations, U is the union of S and D, p, q are the charging event or the first and last station P is the collection of all charging events, Q is the union of P and D; a i is the start time of shift i, l i is the remaining power of the vehicle after the end of shift i; SOC max and SOC min are preset The upper and lower limits of battery power; z ip takes 1 when the charging event p is performed after the electric bus operation shift i ends, otherwise it takes 0, z pj takes 1 when the electric bus operates the shift j after the charging event p, otherwise it takes 0 ; a p is the start time of the charging event p, t p is the charging time of the charging event p, l p is the remaining power of the electric bus before the charging event p starts; The electricity consumed by the charging station where the event p is located, e pj is the electricity consumed by the electric bus driving to the starting point of the shift j after the charging event p is over, and t ip is the electric bus traveling to the location of the charging event p after the operating shift i is over The time consumed by the charging station, t pj is the time consumed by the electric bus to travel to the starting station of shift j after the charging event p is completed; t ij is the time consumed by the electric bus traveling from the terminal station of shift i to the starting station of shift j time, e ij is the power consumed by the electric bus traveling from the terminal station of flight i to the starting station of flight j; M is a sufficiently large number; F(l p ,t p ) is the charging function, with l p and t p is the independent variable, and the dependent variable is the remaining power of the electric bus after the charging event p ends.

所述自适应遗传算法的连续变化交叉概率为:The continuously changing crossover probability of the adaptive genetic algorithm is:

自适应遗传算法的连续变化变异概率为:The continuous change mutation probability of adaptive genetic algorithm is:

其中,Pc1、Pc2、Pm1、Pm2均为大于0小于1的常数,g为当前的遗传代数,G为最大遗传代数,f′为交叉操作前个体的适应度,f为变异操作前个体的适应度,为种群所有个体的平均适应度,fmax为种群所有个体中最大的适应度,kc为自适应交叉概率随遗传代数变化的变化率,km为自适应变异概率随遗传代数变化的变化率。Among them, P c1 , P c2 , P m1 , and P m2 are constants greater than 0 and less than 1, g is the current genetic algebra, G is the maximum genetic algebra, f′ is the fitness of the individual before the crossover operation, and f is the mutation operation The fitness of the former individual, is the average fitness of all individuals in the population, f max is the maximum fitness of all individuals in the population, k c is the change rate of adaptive crossover probability with the change of genetic algebra, k m is the change rate of adaptive mutation probability with the change of genetic algebra .

所述的自适应遗传算法基于可行解变换法,即遗传算法的交叉、变异操作均在可行解范围内。The adaptive genetic algorithm is based on a feasible solution transformation method, that is, the crossover and mutation operations of the genetic algorithm are all within the range of feasible solutions.

所述自适应遗传算法采用整数编码形式,染色体基因位个数为电动公交系统一天班次数的2倍,奇数位基因位从左到右顺序代表班次从早到晚顺序,染色体的奇数位基因位数字b(b≥1)代表运营该班次的车辆编号,偶数位基因位数字c(c≤0)代表充电站编号,当c=0时代表班次结束后没有去充电站充电,当c<0时代表班次结束后去充电站编号为c的充电站充电。The adaptive genetic algorithm adopts an integer coding form, the number of chromosome genes is twice the number of shifts in a day of the electric bus system, the order of odd-numbered genes from left to right represents the order of shifts from morning to night, and the number of odd-numbered genes in chromosomes The number b (b≥1) represents the number of the vehicle operating the shift, and the even-numbered digit c (c≤0) represents the number of the charging station. When c=0, it means that the shift has not been charged at the charging station after the end of the shift. When c<0 The time representative goes to the charging station numbered c to charge after the end of the shift.

所述自适应遗传算法适应度函数采用如下公式标定:The adaptive genetic algorithm fitness function is calibrated by the following formula:

其中,TCreci为染色体个体解码计算得到的电动公交系统总成本的倒数,TCreci_min为种群中所有个体TCreci的最小值,TCreci_max为种群中所有个体TCreci的最大值,r为一较小的正值常数。Among them, TC reci is the reciprocal of the total cost of the electric bus system calculated by chromosome individual decoding, TC reci_min is the minimum value of all individual TC reci in the population, TC reci_max is the maximum value of all individual TC reci in the population, and r is a small positive constant of .

所述电动公交线网运营调度包括电动公交车队大小、车辆排班调度以及车辆充电调度,所述车辆排班调度为多车场多线路排班调度,车辆充电调度包括日间充电调度及夜间充电,且充电方式包括部分充电。The operation scheduling of the electric bus network includes the size of the electric bus fleet, vehicle scheduling and vehicle charging scheduling, the vehicle scheduling is multi-depot multi-line scheduling, and vehicle charging scheduling includes daytime charging scheduling and nighttime charging , and the charging method includes partial charging.

所述电动公交充电设施布设包括电动公交充电桩的位置布设以及各位置的数量布设。The layout of the electric bus charging facilities includes the location layout of the electric bus charging piles and the quantity layout of each location.

与现有技术相比,本发明具有以下优点:Compared with the prior art, the present invention has the following advantages:

(1)求解电动公交线网运营调度及充电设施布设优化模型可同时优化电动公交的排班调度计划、充电调度计划及充电设施布设方案,使电动公交系统的规划更接近实际情况。(1) Solving the optimization model of electric bus network operation scheduling and charging facility layout can simultaneously optimize the electric bus schedule scheduling plan, charging scheduling plan and charging facility layout plan, making the planning of the electric bus system closer to the actual situation.

(2)不仅适用于单一电价,还适用于分时电价等电价收费场景,使电动公交系统的规划更接近实际情况。(2) It is not only applicable to a single electricity price, but also applicable to electricity price charging scenarios such as time-of-use electricity price, so that the planning of the electric bus system is closer to the actual situation.

(3)从线网层面建模,可进行多车场多线路的电动公交排班调度。(3) Modeling from the line network level can carry out electric bus scheduling with multiple depots and multiple lines.

(4)考虑充电不一定充满的部分充电方式,与充电即充满的充电方式相比,电动公交充电调度更为灵活,实现错峰充电,减少用电费用,提高电动公交车辆和充电设施的利用率。(4) Consider the partial charging method that is not necessarily fully charged. Compared with the charging method that is fully charged, the charging scheduling of electric buses is more flexible, which can realize off-peak charging, reduce electricity costs, and improve the utilization of electric buses and charging facilities. Rate.

(5)应用基于可行解变换的改进自适应遗传算法,可避免遗传算法早熟,提高遗传算法的寻优效率。(5) Applying the improved adaptive genetic algorithm based on feasible solution transformation can avoid premature genetic algorithm and improve the optimization efficiency of genetic algorithm.

附图说明Description of drawings

图1为本发明的流程图;Fig. 1 is a flowchart of the present invention;

图2为本发明的自适应遗传算法流程图;Fig. 2 is the adaptive genetic algorithm flowchart of the present invention;

图3为本发明的自适应遗传算法染色体编码示意图;Fig. 3 is the schematic diagram of chromosome coding of adaptive genetic algorithm of the present invention;

图4为本发明实施例的公交线网图;Fig. 4 is the bus network figure of the embodiment of the present invention;

图5为本发明实施例的电价收费标准时变图;Fig. 5 is the time-varying diagram of the charging standard of electricity price in the embodiment of the present invention;

图6为本发明实施例的电动公交车队电池剩余电量变化情况图;Fig. 6 is a graph showing the variation of the remaining battery power of the electric bus fleet according to the embodiment of the present invention;

图7为本发明实施例的一辆电动公交车电池剩余电量变化情况图;Fig. 7 is a graph showing the change of the remaining power of an electric bus battery according to an embodiment of the present invention;

图8为本发明实施例的电动公交系统各小时充电耗电量变化情况图。Fig. 8 is a graph showing the variation of charging power consumption in each hour of the electric bus system according to the embodiment of the present invention.

具体实施方式Detailed ways

下面结合附图和具体实施例对本发明进行详细说明。本实施例以本发明技术方案为前提进行实施,给出了详细的实施方式和具体的操作过程,但本发明的保护范围不限于下述的实施例。The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments. This embodiment is carried out on the premise of the technical solution of the present invention, and detailed implementation and specific operation process are given, but the protection scope of the present invention is not limited to the following embodiments.

实施例Example

本实施例提供一种电动公交系统规划方法,如图1所示,包括以下步骤:This embodiment provides a method for planning an electric public transport system, as shown in Figure 1, comprising the following steps:

第一步,公交线网及线网中各线路运营数据收集。通过向公交公司咨询或查阅相关网站收集公交线网站点信息、站点间空驶时长信息以及线路运营时刻表信息。其中,公交线网站点信息主要包括线网中各条线路首末站的车位数、配建设施以及电网条件,进而评估筛选得到有条件布设充电设施的站点。站点间空驶时长信息可以通过实地测试或利用爬虫期数通过在线地图API获取,用于车辆排班或充电空驶调度时长计算。线路运营时刻表信息则包括线路所有班次发车站点及时刻、结束站点及时刻。The first step is to collect bus network and operation data of each line in the network. Collect bus line site information, empty driving time between sites, and line operation timetable information by consulting the bus company or consulting relevant websites. Among them, the site information of the bus line mainly includes the number of parking spaces, supporting facilities, and power grid conditions at the first and last stations of each line in the line network, and then evaluates and screens the sites that can be equipped with charging facilities. The information on the idling time between stations can be obtained through field tests or through the online map API by using the number of crawlers, and is used for the calculation of vehicle scheduling or charging idling scheduling. The line operation timetable information includes the departure station and time, the end station and time of all shifts on the line.

第二步,电动公交系统建设及运维费用信息收集,包括拟采购电动公交车辆购置及运维费用、充电设施购置及运维费用、电价收费标准以及司机工资等运营相关的用工费用信息。The second step is the collection of information on the construction and operation and maintenance costs of the electric bus system, including the purchase and operation and maintenance costs of the proposed electric bus vehicles, the purchase and operation and maintenance costs of charging facilities, the electricity price charging standard, and the driver's wages and other operation-related labor cost information.

第三步,电动公交车辆电池充放电特性标定。可通过实地运营测试或咨询车辆供应商标定电动公交车辆的电池充放电特性。The third step is to calibrate the charging and discharging characteristics of the electric bus battery. The battery charging and discharging characteristics of electric bus vehicles can be specified through field operation tests or consultation with vehicle suppliers.

第四步,构建电动公交运营调度及充电设施布设优化模型。该模型考虑电动公交的车辆排班、电量消耗、充电排班等约束,以最小化电动公交系统建设及运维总成本最小为优化目标构建模型。The fourth step is to build an optimization model for electric bus operation scheduling and charging facility layout. The model considers the constraints of vehicle scheduling, power consumption, and charging scheduling of electric buses, and builds a model with the optimization goal of minimizing the total cost of electric bus system construction and operation and maintenance.

模型的目标函数如下:The objective function of the model is as follows:

其中,Z是电动公交系统总成本,由电动公交购置成本、电动公交充电设施购置成本、电费成本以及电动公交运营成本四个部分组成;cb为电动公交车单辆购置成本,cc为充电设施单个购置成本,ce为电价,ct为电动公交每小时运营成本,ei为班次i消耗的电量,ti为班次i的运营时长,Eij为班次j开始时与班次i结束时相比的电池电量变化量,Tij为车辆从班次i结束到到达班次j起点站所需的时长;xij在电动公交车辆在班次i运营结束后运营班次j时取1,否则取0;ypq为充电桩在充电事件p结束后执行充电事件q时取1,否则取0。Among them, Z is the total cost of the electric bus system, which is composed of four parts: electric bus purchase cost, electric bus charging facility purchase cost, electricity cost, and electric bus operation cost; c b is the purchase cost of a single electric bus, and c c is the charging cost Single purchase cost of facility, c e is the electricity price, c t is the operating cost of electric bus per hour, e i is the electricity consumption of shift i, t i is the operation time of shift i, E ij is the start time of shift j and the end time of shift i Compared with the change in battery power, T ij is the time required for the vehicle to arrive at the starting point of shift j from the end of shift i; x ij takes 1 when the electric bus operates shift j after shift i ends, and takes 0 otherwise; y pq is 1 when the charging pile executes the charging event q after the charging event p is completed, otherwise it is 0.

模型包括以下约束:The model includes the following constraints:

车辆排班约束:Vehicle scheduling constraints:

其中,约束(2)表示每一个班次有且仅有一辆电动公交车运营。约束(3)说明电动公交车在当前运营班次结束后将运行下一个班次。约束(4)表示由同一辆电动公交运营的前后两个班次运营时间不重叠。约束(5)定义了决策变量xij的取值范围。Among them, constraint (2) means that there is only one electric bus operating in each shift. Constraint (3) states that the electric bus will run the next shift after the current operating shift ends. Constraint (4) means that the operating hours of the two shifts operated by the same electric bus do not overlap. Constraint (5) defines the value range of the decision variable x ij .

电量消耗约束:Power Consumption Constraints:

其中,约束(6)限制电动公交车辆电池剩余电量始终在上限SOCmax和下限SOCmin之间。约束(7)初始化电动公交在一天开始运营第一个班次前的电池剩余电量为SOCmax。约束(8)表示班次j结束时电动公交车辆电池的剩余电量与班次i结束时剩余电量之间的关系。Among them, constraint (6) restricts the remaining battery power of electric bus vehicles to always be between the upper limit SOC max and the lower limit SOC min . Constraint (7) Initialize the remaining battery power of the electric bus before the first shift of the day to be SOC max . Constraint (8) represents the relationship between the remaining power of the electric bus battery at the end of shift j and the remaining power at the end of shift i.

充电排班约束:Charging schedule constraints:

其中,约束(9)表示同一个充电桩在当前充电事件结束后将进行下一个充电事件。约束(10)表示充电事件开始前有且仅有一辆电动公交车班次运营结束后来到充电站进行充电。约束(11)说明每个充电桩在任意时刻至多为一辆电动公交车充电。约束(12)说明电动公交车充电结束后会运营下一个班次或结束一天的运营回到车场。约束(13)表示同一个充电桩的前后两个充电事件在时间上不重叠。约束(14)表示一辆电动公交车的充电时间不与后续的班次时间重叠。约束(15)至(19)定义了各决策变量的取值范围。Among them, constraint (9) indicates that the same charging pile will carry out the next charging event after the current charging event ends. Constraint (10) means that before the charging event starts, there is only one electric bus that comes to the charging station for charging after the operation ends. Constraint (11) states that each charging pile can charge at most one electric bus at any time. Constraint (12) states that the electric bus will operate the next shift or return to the depot after the end of the day's operation after charging. Constraint (13) means that the two charging events before and after the same charging pile do not overlap in time. Constraint (14) states that the charging time of an electric bus does not overlap with the subsequent bus time. Constraints (15) to (19) define the value range of each decision variable.

中间变量计算:Intermediate variable calculation:

其中,约束(20)至(22)定义了中间变量Eij、Tij和lp的计算公式。Among them, constraints (20) to (22) define the calculation formulas of the intermediate variables E ij , T ij and l p .

模型中的变量及参数说明如表1所示,本实施例主要针对早高峰通勤乘客需求构建模型。The variables and parameter descriptions in the model are shown in Table 1. This embodiment mainly builds a model for commuting passenger demand in the morning rush hour.

表1模型参数说明Table 1 Description of model parameters

第五步,改进自适应遗传算法求解模型,改进自适应遗传算法流程图如图2所示,其共有如下四点特征:The fifth step is to improve the adaptive genetic algorithm to solve the model. The flow chart of the improved adaptive genetic algorithm is shown in Figure 2, which has the following four characteristics:

(1)该改进自适应遗传算法基于可行解变换法,即遗传算法的交叉、变异操作均在可行解范围内,不会产生不可行解。(1) The improved adaptive genetic algorithm is based on the feasible solution transformation method, that is, the crossover and mutation operations of the genetic algorithm are all within the range of feasible solutions, and no infeasible solutions will be generated.

(2)该改进自适应遗传算法采用整数编码形式,染色体编码示意图如图3所示。染色体基因位个数为电动公交系统一天班次数的2倍,奇数位基因位从左到右顺序代表班次从早到晚顺序,染色体的奇数位基因位数字b(b≥1)代表运营该班次的车辆编号,偶数位基因位数字c(c≤0)代表充电站编号,当c=0时代表班次结束后没有去充电站充电,当c<0时代表班次结束后去充电站编号为c的充电站充电。(2) The improved adaptive genetic algorithm adopts the form of integer coding, and the schematic diagram of chromosome coding is shown in Fig. 3 . The number of chromosomal gene bits is twice the number of daily shifts of the electric bus system. The order of odd-numbered gene bits from left to right represents the order of shifts from morning to night. The odd-numbered gene bit number b (b≥1) of the chromosome represents the operation of the shift The vehicle number of the vehicle, the even-numbered digit c (c≤0) represents the charging station number, when c=0, it means that the charging station has not been charged after the end of the shift, and when c<0, it means that the number of the charging station is c after the end of the shift charging station.

(3)该改进自适应遗传算法的交叉概率Pc和变异概率Pm可变,与种群个体适应度和遗传代数有关,且种群个体适应度越高,Pc和Pm越小,遗传代数g(g∈[0,G])越大,Pc越小,Pm越大,这样可以避免算法早熟,提高寻优性能。自适应交叉概率和自适应变异概率计算公式如式(23)至(24)所示。(3) The crossover probability P c and mutation probability P m of the improved adaptive genetic algorithm are variable , which are related to the fitness of the population individual and the genetic algebra. The larger g(g∈[0,G]), the smaller Pc and the larger Pm , which can avoid premature algorithm and improve the optimization performance. The calculation formulas of adaptive crossover probability and adaptive mutation probability are shown in formulas (23) to (24).

其中,Pc1、Pc2、Pm1、Pm2均为大于0小于1的常数,g为当前的遗传代数,G为最大遗传代数,f′为交叉操作前个体的适应度,f为变异操作前个体的适应度,为种群所有个体的平均适应度,fmax为种群所有个体中最大的适应度,kc为自适应交叉概率随遗传代数变化的变化率,km为自适应变异概率随遗传代数变化的变化率。该改进自适应遗传算法可避免算法早熟,提高算法寻优效率。Among them, P c1 , P c2 , P m1 , and P m2 are constants greater than 0 and less than 1, g is the current genetic algebra, G is the maximum genetic algebra, f′ is the fitness of the individual before the crossover operation, and f is the mutation operation The fitness of the former individual, is the average fitness of all individuals in the population, f max is the maximum fitness of all individuals in the population, k c is the change rate of adaptive crossover probability with the change of genetic algebra, k m is the change rate of adaptive mutation probability with the change of genetic algebra . The improved self-adaptive genetic algorithm can avoid premature algorithm and improve the optimization efficiency of the algorithm.

(4)为了提高遗传算法的选择效率,该改进自适应遗传算法适应度函数采用如式(25)标定:(4) In order to improve the selection efficiency of the genetic algorithm, the fitness function of the improved adaptive genetic algorithm is calibrated by formula (25):

其中,TCreci为染色体个体解码计算得到的电动公交系统总成本的倒数,TCreci_min为种群中所有个体TCreci的最小值,TCreci_max为种群中所有个体TCreci的最大值,r为一较小的正值常数。该适应度函数标定方法可提高遗传算法选择效率。Among them, TC reci is the reciprocal of the total cost of the electric bus system calculated by chromosome individual decoding, TC reci_min is the minimum value of all individual TC reci in the population, TC reci_max is the maximum value of all individual TC reci in the population, and r is a small positive constant of . The fitness function calibration method can improve the selection efficiency of genetic algorithm.

下面为一具体例子:The following is a specific example:

本例以上海市嘉定区安亭镇的8条公交线路(线路图如图4所示)为研究场景,优化将8条公交线路的柴油公交车全部换成插电式常规纯电动公交车所需的总成本。示例中一天共有867个公交班次,公交时刻表通过嘉定公交官网获取,结合地图实景判断线路中所有首末站的站点条件,各条线路的班次概况如表2所示,共涉及到12个起终站点,其中5个站点为公交车场并有条件布设充电设施(本例认为只在公交车场设置充电站),其余起终站点较小,公交车只能临时停靠,线网中所有起终站点概况如表3所示。由于无法实地运营测试,站点之间的行驶时长利用高德API爬取得到。This example takes 8 bus lines in Anting Town, Jiading District, Shanghai (the route diagram is shown in Figure 4) as the research scenario, and optimizes the replacement of diesel buses on 8 bus lines with plug-in conventional pure electric buses. total cost required. In the example, there are 867 bus trips in one day. The bus schedule is obtained from the official website of Jiading Public Transport, and the site conditions of all the first and last stations in the route are judged based on the actual map. The trip overview of each line is shown in Table 2, involving 12 starting points Terminal stations, 5 of which are bus yards and charging facilities are conditionally arranged (in this example, only charging stations are set up in bus yards). The overview of the terminal sites is shown in Table 3. Due to the inability to operate the test in the field, the driving time between the stations was obtained by crawling through the AutoNavi API.

表2各线路班次概况表Table 2 Overview of the frequency of each line

表3公交线网中所有起终站点概况表Table 3 Overview of all origin and destination stations in the bus network

站点名称Site name 站点编号station number 经度longitude 纬度latitude 相关线路related lines 是否可作为充电站Can it be used as a charging station 公交安亭站Anting Bus Station -1-1 121.16121.16 31.2931.29 1,21,2 和静路安亭老街站Hejing Road Anting Old Street Station -2-2 121.15121.15 31.3031.30 4,64,6 安亭北火车站Anting North Railway Station -3-3 121.16121.16 31.3131.31 77 上海赛车场Shanghai Circuit -4-4 121.23121.23 31.3331.33 1,81,8 黄渡汽车站Huangdu Bus Station -5-5 121.21121.21 31.2731.27 7,87,8 公交昌吉东路站Bus Changji East Road Station -6-6 121.20121.20 31.2931.29 33 向阳村Xiangyang Village -7-7 121.14121.14 31.3031.30 33 翔方公路胜辛南路Shengxin South Road, Xiangfang Highway -8-8 121.26121.26 31.3131.31 22 联群村Lianqun Village -9-9 121.25121.25 31.2831.28 55 联西村lianxi village -10-10 121.25121.25 31.2731.27 44 邓家角村Dengjiajiao Village -11-11 121.20121.20 31.2631.26 5,65,6 安智路邓家角村Dengjiajiao Village, Anzhi Road -12-12 121.19121.19 31.2631.26

第二步中,本例中用到的上海市分时电价收费标准如图5所示,其他电动公交系统建设及3年运维费用模型参数取值如表4所示。In the second step, the Shanghai time-of-use electricity price charging standard used in this example is shown in Figure 5, and the parameters of other electric bus system construction and 3-year operation and maintenance cost models are shown in Table 4.

表4电动公交系统建设及运维费用模型参数取值表Table 4 Value table of electric bus system construction and operation and maintenance cost model parameters

模型参数Model parameters 含义meaning 取值value cb c b 电动公交车单辆购置成本Electric bus unit purchase cost 1,500,000元1,500,000 yuan cc c c 充电设施单个购置成本Single purchase cost of charging facilities 450,000元450,000 yuan ct c t 电动公交每小时运营成本Electric bus operating cost per hour 25元/小时25 yuan/hour

第三步中,本例采用比亚迪K9电动公交车型标定车辆电池充放电特性。由于无法实地运营测试,本例假设电池充放电函数均为线性函数。本例使用的电池充放电函数定义如表5及式(26)至(29)所示。In the third step, this example uses the BYD K9 electric bus model to calibrate the charging and discharging characteristics of the vehicle battery. Since it is impossible to operate the test in the field, this example assumes that the battery charge and discharge functions are all linear functions. The definition of the battery charge and discharge function used in this example is shown in Table 5 and equations (26) to (29).

表5电池充放电函数表Table 5 Battery charge and discharge function table

函数function 函数描述function description F(lp,tp)F(l p ,t p ) 以lp和tp为自变量的充电函数Charging function with l p and t p as arguments G(ti)G(t i ) 以ti为自变量,ei为因变量的放电函数The discharge function with t i as the independent variable and e i as the dependent variable G(tip)G(t ip ) 以tip为自变量,eip为因变量的放电函数Discharge function with t ip as independent variable and e ip as dependent variable G(tpj)G(t pj ) 以tpj为自变量,epj为因变量的放电函数Discharge function with t pj as independent variable and e pj as dependent variable

其中,与电动公交电池特性及电池剩余电量上下限阈值相关的模型参数取值如表6所示。Among them, the values of the model parameters related to the characteristics of the electric bus battery and the upper and lower thresholds of the remaining battery power are shown in Table 6.

表6电动公交电池特性及电池剩余电量上下限阈值相关的模型参数取值表Table 6 Value table of model parameters related to electric bus battery characteristics and the upper and lower thresholds of remaining battery power

第五步基于第四步构建的电动公交运营调度及充电设施布设优化模型,使用改进遗传算法相关参数的取值如表7所示。The fifth step is based on the electric bus operation scheduling and charging facility layout optimization model built in the fourth step, and the values of related parameters using the improved genetic algorithm are shown in Table 7.

表7改进遗传算法相关参数取值表Table 7 Value table of related parameters of improved genetic algorithm

算法参数Algorithm parameters 含义meaning 取值value PP 遗传算法种群大小Genetic Algorithm Population Size 100100 GG 最大进化代数maximum evolution algebra 20002000 rr 适应度标定函数中的较小正数small positive number in the fitness scaling function 0.010.01 Pc1 P c1 自适应交叉概率初始最大值Adaptive Crossover Probability Initial Maximum 0.950.95 Pc2 P c2 自适应交叉概率初始最小值Adaptive Crossover Probability Initial Minimum 0.850.85 kc k c 自适应交叉概率随遗传代数变化的变化率Rate of Change of Adaptive Crossover Probability as Genetic Algebra Changes 11 Pm1 P m1 自适应变异概率初始最大值Adaptive Mutation Probability Initial Maximum 0.10.1 Pm2 P m2 自适应变异概率初始最小值Adaptive Mutation Probability Initial Minimum 0.050.05 km k m 自适应变异概率随遗传代数变化的变化率Rate of Change of Adaptive Mutation Probability as Genetic Algebra Changes 0.20.2

第五步完成后,求解得到最优解电动公交系统建设及3年运维总成本为154421053.88元,包括电动公交购置成本109500000元(占比70.9%)、电动公交充电设施购置成本10350000元(占比6.7%)、电费成本14086341.38(占比9.1%)以及电动公交运营成本20484712.5元(占比13.3%)。其中,电动公交系统共有73辆电动公交车和21个充电桩,一辆电动公交车每天平均运营11.88个班次,服务5.18条线路,行驶221.18千米。After the completion of the fifth step, the optimal solution for the construction of the electric bus system and the total cost of 3-year operation and maintenance is 154,421,053.88 yuan, including the purchase cost of electric buses of 109,500,000 yuan (accounting for 70.9%) and the purchase cost of electric bus charging facilities of 103,500,000 yuan (accounting for ratio 6.7%), electricity cost 14086341.38 (accounting for 9.1%) and electric bus operating cost 20484712.5 yuan (accounting for 13.3%). Among them, the electric bus system has a total of 73 electric buses and 21 charging piles. An electric bus operates an average of 11.88 shifts per day, serves 5.18 lines, and travels 221.18 kilometers.

其中,一个24小时运营周期内73辆电动公交车的电池剩余电量变化情况如图6所示,具体来看,其中一辆电动公交车一个24小时运营周期内的电池剩余电量变化情况如图7所示。可以看出,部分充电方式让电动公交车辆的充电调度计划十分灵活,大量的充电时间在夜间非运营时段完成,减少了对日间运营时段时间的占用,在运营时段内最大程度利用了电动公交车辆资源。Among them, the change of the remaining battery power of 73 electric buses in a 24-hour operation cycle is shown in Figure 6. Specifically, the change of the remaining battery power of one of the electric buses in a 24-hour operation cycle is shown in Figure 7 shown. It can be seen that the partial charging method makes the charging scheduling plan of electric buses very flexible. A large amount of charging time is completed during non-operating hours at night, which reduces the occupation of daytime operating hours and maximizes the use of electric buses during operating hours. Vehicle resources.

另外,一个24小时运营周期内电动公交系统各小时充电耗电量如图8所示。可以看出,电动公交系统充电耗电量与分时电价波动趋势相反,说明最优解的电动公交充电调度计划最大程度利用电价较低的时段进行充电,最大程度节省了用电成本。In addition, the charging power consumption of the electric bus system for each hour in a 24-hour operation cycle is shown in Figure 8. It can be seen that the charging power consumption of the electric bus system is opposite to the fluctuation trend of the time-of-use electricity price, indicating that the optimal electric bus charging scheduling plan maximizes the use of low electricity prices for charging, and saves electricity costs to the greatest extent.

本实施例在电动公交系统替代传统公交系统的发展背景下,在不改变原有公交时刻表约束的情况下,应用改进自适应遗传算法同步优化电动公交的排班调度计划、充电调度计划及充电设施布设方案,使得电动公交系统建设及运维总成本最小。应用该模型及算法求解得到的电动公交运营调度及充电设施布设方案具备较好的运营可行性和经济性,可为电动公交系统的规划、运营和管理提供参考。In this embodiment, under the background of the development of the electric bus system replacing the traditional bus system, without changing the constraints of the original bus schedule, the improved self-adaptive genetic algorithm is applied to simultaneously optimize the schedule scheduling plan, charging scheduling plan and charging schedule of the electric bus. The facility layout plan minimizes the total cost of electric bus system construction and operation and maintenance. The electric bus operation scheduling and charging facility layout scheme obtained by applying the model and algorithm has good operational feasibility and economy, and can provide reference for the planning, operation and management of the electric bus system.

Claims (8)

1. An electric bus system planning method is characterized by comprising the following steps:
step S1: acquiring bus network information and cost information, wherein the bus network information comprises bus network station information, inter-station empty driving duration information and line operation timetable information, and the bus network station information comprises the number of vehicle positions of the first and last stations of each line in a network, configuration facilities and power grid conditions;
step S2: utilizing bus network information and cost information to establish an electric bus network operation scheduling and charging facility layout optimization model with the minimum total cost of an electric bus system as a target;
step S3: solving an electric bus network operation scheduling and charging facility layout optimization model by utilizing a self-adaptive genetic algorithm of the continuous variation crossover probability and the continuous variation probability to obtain an electric bus system related to electric bus network operation scheduling and electric bus charging facility layout;
the objective function of the electric bus network operation scheduling and charging facility layout optimization model is as follows:
z is the total cost of the electric bus system and consists of four parts, namely electric bus acquisition cost, electric bus charging facility acquisition cost, electric charge cost and electric bus operation cost; c b C, the acquisition cost of a single electric bus is c c C, for the single purchase cost of the charging facility e For electricity price, c t E, operating cost per hour of electric bus i For the amount of electricity consumed by shift i, t i For the operating duration of class i, E ij As the battery power change amount at the beginning of shift j compared with the end of shift i, T ij The time period required from the end of the shift i to the arrival of the vehicle at the start station of the shift j is set; x is x ij Taking 1 when the electric bus operates in the shift j after the operation of the shift i is finished, or taking 0; y is pq Taking 1 for the charging pile when the charging event q is executed after the charging event p is finished, otherwise taking 0;
constraint conditions of the electric bus network operation scheduling and charging facility layout optimization model comprise:
vehicle scheduling constraints:
power consumption constraint:
charging scheduling constraints:
E ij 、T ij and l p The calculation formula of (2) is as follows:
wherein i, j is the number of the shift or the first and last station, S is the set of all bus shifts, D is the set of all first and last stations, U is the union of S and D, P and Q are the numbers of charging events or the first and last stations, P is the set of all charging events, and Q is the union of P and D; a, a i For the start time of shift i, l i The remaining power of the vehicle after the shift i is finished; SOC (State of Charge) max ,SOC min The upper limit and the lower limit of the battery electric quantity are preset; z ip Taking 1 when charging event p is carried out after operation shift i of electric bus is finished, otherwise taking 0, z pj Taking 1 when operating the shift j after the electric bus carries out the charging event p, otherwise taking 0; a, a p To start time of charging event p, t p For the charge duration of the charge event p, l p The remaining capacity of the electric bus before the charging event p begins; e, e ip E is the electric quantity consumed by the electric bus running to the charging station where the charging event p is located after the operation shift i is finished pj For the electric quantity consumed by the electric bus to travel to the start station of shift j after the charging event p is finished, t ip For the time t consumed by the electric bus to travel to the charging station where the charging event p is located after the operation shift i is finished pj The time consumed for the electric bus to travel to the start station of shift j after the charging event p is finished; t is t ij For the time spent by the electric bus from the stop of class i to the start of class j, e ij The electric bus runs from the destination station of class i to the starting station of class j to consume electric quantity; m is a sufficiently large number; f (l) p ,t p ) For the charging function, let l p And t p The dependent variable is the residual electric quantity of the electric bus after the charging event p is ended.
2. A method of planning an electric bus system according to claim 1 wherein the cost information includes a price of electricity charging standard, the price of electricity charging standard including a single price of electricity charging standard and a time-of-use price of electricity charging standard.
3. The electric bus system planning method according to claim 1, wherein the continuous variation crossover probability of the adaptive genetic algorithm is:
the continuous variation mutation probability of the adaptive genetic algorithm is as follows:
wherein P is c1 、P c2 、P m1 、P m2 Are constants greater than 0 and less than 1, G is the current genetic algebra, G is the maximum genetic algebra, and f' is the cross operationThe fitness of the individuals before the mutation operation, f is the average fitness of all the individuals in the population, f max For maximum fitness, k, among all individuals of a population c K is the change rate of the adaptive crossover probability along with the change of the genetic algebra m Is the change rate of the adaptive mutation probability along with the change of the genetic algebra.
4. The electric bus system planning method according to claim 1, wherein the adaptive genetic algorithm is based on a feasible solution transformation method, that is, the crossover and mutation operations of the genetic algorithm are all within the feasible solution range.
5. The method for planning an electric bus system according to claim 1, wherein the adaptive genetic algorithm adopts an integer coding form, the number of chromosome gene digits is 2 times of the number of shifts of the electric bus system in one day, the odd gene digits represent the sequence from the left to the right, the odd gene digits b (b not less than 1) of the chromosome represent the number of vehicles operating the shift, the even gene digits c (c not more than 0) represent the number of charging stations, no charging station is charged after the shift is finished when c=0, and the charging station with the number of charging stations c is charged after the shift is finished when c < 0.
6. The electric bus system planning method according to claim 1, wherein the adaptive genetic algorithm fitness function is calibrated by the following formula:
wherein TC is reci Inverse, TC, of total cost of electric bus system calculated for chromosome individual decoding reci_min For all individuals TC in the population reci Minimum value of (C) TC reci_max For all individuals TC in the population reci R is a positive constant.
7. The method of claim 1, wherein the electric bus network operation schedule comprises an electric bus fleet size, a vehicle scheduling and a vehicle charging schedule, the vehicle scheduling is a multi-yard multi-line scheduling, the vehicle charging schedule comprises a daytime charging schedule and a nighttime charging schedule, and the charging mode comprises partial charging.
8. The electric bus system planning method according to claim 1, wherein the electric bus charging facility layout comprises a position layout of electric bus charging piles and a number layout of positions.
CN202010663544.1A 2020-07-10 2020-07-10 A planning method for electric bus system Active CN111915150B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010663544.1A CN111915150B (en) 2020-07-10 2020-07-10 A planning method for electric bus system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010663544.1A CN111915150B (en) 2020-07-10 2020-07-10 A planning method for electric bus system

Publications (2)

Publication Number Publication Date
CN111915150A CN111915150A (en) 2020-11-10
CN111915150B true CN111915150B (en) 2023-09-01

Family

ID=73226322

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010663544.1A Active CN111915150B (en) 2020-07-10 2020-07-10 A planning method for electric bus system

Country Status (1)

Country Link
CN (1) CN111915150B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112906983B (en) * 2021-03-22 2022-10-21 吉林大学 An optimization method of electric bus charging scheme considering the influence of time-of-use electricity price
CN113836735B (en) * 2021-09-30 2023-08-29 昆明理工大学 Method for establishing two-stage model of electric bus cluster charging and battery-changing strategy in battery-changing mode
CN114239201B (en) * 2021-12-15 2024-10-15 吉林大学 Electric bus line dynamic wireless charging facility layout method based on opportunity constraint planning
CN114331353B (en) * 2021-12-28 2024-09-20 扬州大学 Bus safety operation scheduling optimization method based on genetic algorithm
CN114444965B (en) * 2022-02-11 2024-05-14 吉林大学 Single-yard multi-line electric bus collaborative scheduling method
CN115239096B (en) * 2022-07-06 2024-08-02 四川省交通运输发展战略和规划科学研究院 A modular bus charging scheduling method for multiple cross-line
CN115115243B (en) * 2022-07-06 2024-08-20 四川省交通运输发展战略和规划科学研究院 Modularized bus running and charging scheduling method for uninterrupted main line

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108062619A (en) * 2017-12-04 2018-05-22 中车工业研究院有限公司 A kind of rail vehicle ground integrated capacity collocation method and device
CN110705745A (en) * 2019-08-27 2020-01-17 北京交通大学 A method for optimal planning and orderly exit of electric bus charging station
CN111325483A (en) * 2020-03-17 2020-06-23 郑州天迈科技股份有限公司 Electric bus scheduling method based on battery capacity prediction

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9058443B2 (en) * 2012-07-17 2015-06-16 International Business Machines Corporation Planning economic energy dispatch in electrical grid under uncertainty

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108062619A (en) * 2017-12-04 2018-05-22 中车工业研究院有限公司 A kind of rail vehicle ground integrated capacity collocation method and device
CN110705745A (en) * 2019-08-27 2020-01-17 北京交通大学 A method for optimal planning and orderly exit of electric bus charging station
CN111325483A (en) * 2020-03-17 2020-06-23 郑州天迈科技股份有限公司 Electric bus scheduling method based on battery capacity prediction

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
考虑移步需求的无桩型共享单车动态调度研究;李兴华;《交通运输系统工程与信息》;全文 *

Also Published As

Publication number Publication date
CN111915150A (en) 2020-11-10

Similar Documents

Publication Publication Date Title
CN111915150B (en) A planning method for electric bus system
CN110880054B (en) Planning method for electric network car-booking charging and battery-swapping path
CN111754039B (en) Pure electric bus network comprehensive integrated optimization design method
CN109544901A (en) A kind of Research on Intelligent Scheduling of Public Traffic Vehicles method and device based on history passenger flow big data
CN111311122A (en) Construction method of charging station for smart city
CN110189025B (en) Methods to obtain planning solutions for electric vehicle charging stations considering different load growth
CN106965688A (en) A kind of charging electric vehicle method under power network and the network of communication lines cooperative surroundings
Zhang et al. Long-term charging infrastructure deployment and bus fleet transition considering seasonal differences
CN112115385A (en) A location optimization method for one-way shared vehicle system considering charging time
CN114169609A (en) Photovoltaic coupling-considered electric vehicle charging station planning method
CN114462864A (en) A vehicle scheduling method for electric bus lines under the influence of charging facility sharing strategy
CN112053053B (en) Electric vehicle charging station site selection method
Sivagnanam et al. Minimizing energy use of mixed-fleet public transit for fixed-route service
CN106682759A (en) Battery supply system and network optimization method for electric taxis
CN116128235A (en) A vehicle scheduling method for electric bus lines under the coordinated power supply of &#34;light-storage-network&#34;
CN107769199A (en) The linearisation modeling method that a kind of public bus network electrification is distributed rationally
CN117537833A (en) Electric vehicle transportation route planning method, system and terminal based on charging constraints
CN115099702B (en) Electric bus daytime running charging optimization method based on Lagrange relaxation algorithm
CN113627645B (en) Electric bus hybrid charging station charging schedule design method based on robust optimization
CN117236604A (en) An optimization method for electric bus dispatching considering battery replacement and departure time
CN116934040A (en) A day-ahead collaborative optimization scheduling method for mobile charging stations
CN110674988A (en) Urban charging station planning method based on electric vehicle travel big data
CN117114754A (en) Method, device, equipment and storage medium for selecting the location and capacity of a charging station
He et al. Optimal site selection planning of ev charging pile based on genetic algorithm
CN115239172A (en) An electric bus scheduling method considering the life of the power battery

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