CN113780851B - Bus parking lot address selection method based on expected driving cost - Google Patents
Bus parking lot address selection method based on expected driving cost Download PDFInfo
- Publication number
- CN113780851B CN113780851B CN202111088365.0A CN202111088365A CN113780851B CN 113780851 B CN113780851 B CN 113780851B CN 202111088365 A CN202111088365 A CN 202111088365A CN 113780851 B CN113780851 B CN 113780851B
- Authority
- CN
- China
- Prior art keywords
- bus
- parking lot
- cost
- station
- candidate
- 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
Links
- 238000010187 selection method Methods 0.000 title description 2
- 238000000034 method Methods 0.000 claims abstract description 70
- 238000012423 maintenance Methods 0.000 claims abstract description 64
- 230000008569 process Effects 0.000 claims abstract description 39
- 238000010276 construction Methods 0.000 claims abstract description 35
- 238000005457 optimization Methods 0.000 claims abstract description 21
- 239000011159 matrix material Substances 0.000 claims abstract description 15
- 239000002131 composite material Substances 0.000 claims abstract description 13
- 230000005520 electrodynamics Effects 0.000 claims 1
- 230000002354 daily effect Effects 0.000 description 11
- 239000000446 fuel Substances 0.000 description 11
- 238000007726 management method Methods 0.000 description 11
- 239000000295 fuel oil Substances 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 239000003921 oil Substances 0.000 description 2
- 230000008439 repair process Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000009420 retrofitting Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- General Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- Operations Research (AREA)
- Primary Health Care (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a bus parking lot location method based on expected driving cost. Based on urban traffic network data, calculating and obtaining minimum cost paths of 4 conditions of direct arrival between the first and last buses and the candidate vehicle parking lot, only through a stop filling station, only through a stop maintenance site and simultaneously through the stop filling station and the maintenance site, constructing a minimum cost distance matrix, constructing a global optimization algorithm of facility layout with optimal composite cost on the basis of calculating the preference between the different-place parking requirements of each first and last bus station, the refueling and maintenance probability in the process of going to the first and last buses and the vehicle parking lot, the construction cost of a bus department to the vehicle parking lot and the time cost of going to the first and last buses and the parking lot, and calculating the optimal quantity and address of the parking lots of the buses under the new energy background of a bus line, and the parking arrangement of different types of vehicles at each first and last buses under the result.
Description
Technical Field
The invention relates to a bus parking lot location method based on expected driving cost, and belongs to the technical field of big data analysis.
Background
The public transportation system is an important travel mode for urban residents, has extremely important significance for daily operation of the city, and is a tie for interconnecting urban spaces. The public transportation system can conveniently and effectively improve the travel speed of urban residents, enlarges the travel range of the residents, and is an important guarantee that the cities can be continuously expanded. In the rapid urban process, as the city is continuously developed and the population of the city is increased, the urban public transportation system becomes more and more huge and complex, as the number of public transportation lines is continuously increased, the public transportation shift interval and the important area positive point rate requirements are continuously improved, the reserved quantity of the public transportation vehicles is continuously expanded, the first and last stations of the public transportation lines cannot directly bear all the public transportation vehicles on the lines, new public transportation vehicle parking lots are required to be opened around the first and last stations, and the vehicles which cannot park at the first and last stations need to park at night to the different parking lots. However, the location of the parking lot involves multiple factors, firstly, the location of a facility area in the urban environment is affected by multiple factors such as road network, urban land utilization planning, land price and the like, and free location cannot be selected; secondly, parking lot address selection relates to the passing cost and time consumption between the parking lot address selection and bus first and last stops, gas stations and maintenance sites; again, the bus refueling and charging and maintenance activities are statistically random, giving uncertainty to the parking lot location. Based on the method, the invention designs a method for selecting the addresses of the bus parking lots based on expected running cost, obtains the cost distance between the candidate parking lots and the first and last buses, between the gas station and the vehicle maintenance field based on the running time cost of the road traffic network, comprehensively considers the composite cost optimal facility layout and optimization algorithm of factors such as the different-place parking requirements of the bus, the refueling charging and maintenance probability of the bus, the construction cost of the candidate bus parking lots and the like, obtains the required quantity and the optimal addresses of the bus parking lots, and can realize further optimization based on the positions of the existing bus parking lots.
The invention discloses a random planning-based bus team facility site selection-path planning-scheduling method, and the site selection of a vehicle energy charging station is emphasized, and the invention considers that the global and local optimization of the site selection of a bus parking lot at different places is realized on the basis of the existing gas station and maintenance field, and does not relate to site selection optimization of the gas station and maintenance field and optimization of vehicle scheduling. The multi-objective optimized urban public transportation stop site selection model established in academic paper urban public transportation stop site selection model research is not considered when the influence of a gas station and a maintenance site on the parking lot site selection is not considered.
Compared with the existing related researches and patents, the invention has the main innovation that on the basis of the space layout of the existing gas stations and maintenance sites, a facility area location selection algorithm is designed, the composite cost established by CES functions is used as an optimization target, a bus parking lot location selection optimization model is established, and the number and location of the bus parking lots in different places are globally/locally optimized.
Disclosure of Invention
The invention aims to calculate the cost distance between a candidate bus parking lot and a bus head and tail station, a gas station and a vehicle maintenance field by using the running time cost of a road traffic network, calculate the optimal address of the bus parking lot on the basis of analyzing the different-place parking requirements of the vehicles at each bus head and tail station, and further optimize on the basis of the existing bus parking lot. In order to achieve the above object, the present invention provides a multi-objective composite cost optimal facility layout algorithm, comprising the steps of:
Step 1, acquiring the space position, capacity, construction cost and the like related to a public transportation vehicle parking lot from an urban management department and a public transportation system management department, acquiring the information of the position, operation line, vehicles in a volume and the like related to the first and last stations of a public transportation line, and basic data such as urban land utilization data, hierarchical road network data and the like, firstly calculating the parking demands of different places, and calculating the probability of needing to be filled and maintained in the process of going to the first and last stations of the public transportation vehicle and the vehicle parking lot and the charging demands in the parking lot according to the existing vehicle filling, charging and maintaining frequency;
Step 2, calculating the minimum cost distance of the bus in the road traffic network by taking the passing time as the cost aiming at the head and the tail of each bus route and the parking lot of the candidate bus, and respectively calculating the minimum cost distance of the bus by considering 4 possible situations that the bus directly goes to and from the head and the tail and the parking lot, the bus is refueled in the round trip process, the bus is maintained in the round trip process, and the bus is refueled and maintained simultaneously in the round trip process;
step 3, establishing a minimum cost distance matrix, designing a composite cost optimal facility layout algorithm on the basis, comprehensively considering the time cost between a daily bus round-trip parking lot and a bus head-end station and the construction and maintenance cost of the parking lot and a charging terminal thereof under the condition of giving an electric proportion of a bus, and realizing optimal selection of the number and the space position of the parking lot of the bus;
And 4, aiming at the problem of local optimization of further adding stations and reducing cost on the basis of the construction of the original bus parking lot, improving on the basis of the algorithm designed in the step 3, designing a local bus parking lot site selection layout optimization algorithm, and adding a certain number of parking lots on the basis of the original bus parking lot layout to reduce the passing cost of buses, thereby realizing local improvement of the space layout of the bus parking lot.
Preferably, the step 1 includes:
Step 1.1, land utilization data and hierarchical road network data of a city are obtained from a city management department, wherein the land utilization data comprise land types, construction cost, areas and space positions of empty land blocks which can be constructed in the range of a city domain, the constructed parking lot information data comprise facility capacity and rent, the gas station information capable of providing services comprises gas station names and space positions, and the road traffic information data comprise road starting and ending points, road levels and traffic speeds;
Step 1.2, acquiring urban bus lines and vehicle information data of each line from a bus management department, wherein the vehicle information data comprises the first and last station positions of each bus line, the parking capacity of daily different types of buses in the line in order to operate the vehicles, and the first and last stations of the line, and calculating the different-place parking and protection requirements of the vehicles at the first and last stations of each bus For an electric bus, according to the number of existing charging terminals at the head and the tail of the bus, calculating the charging terminal requirements for stopping vehicles at different places at the head and the tail of each bus：
In the method, in the process of the invention,The fuel buses at the first and last stations i of the bus are in the album for operating the vehicles,The electric buses of the first and last stations i of the bus are used for operating the vehicles in a volume,Is the parking area in the first and last stations i of the bus, kappa is the parking area of one bus,The number of charging terminals of the first station and the last station i of the bus is represented;
step 1.3, inquiring a land block suitable for being used as a parking lot of a bus as a candidate facility point position according to the demand characteristics of the bus for parking in different places and the distance from the nearest bus head station to the nearest bus tail station and the land block area, wherein the method comprises the steps of utilizing the existing parking lot and completely creating a new parking lot, and calculating the construction cost of the new parking lot according to the land price of the land block;
Step 1.4, acquiring daily refueling and maintenance frequency of buses belonging to each bus route from a bus management department, and calculating the probability of needing to refuel in a single round trip parking lot of the buses and in the first and last stops of the buses Probability of need for maintenanceAnd the probability of requiring both refuelling and maintenance：
Wherein i represents a bus route, k represents a bus which needs to stop in different places,Indicating the number of bus reservations on bus line i,Indicating the number of average fueling times per day for bus k,Representing the daily average maintenance times of the bus k;
preferably, the step 2 includes:
Step 2.1, calculating the shortest path of the buses of each bus head and tail station to directly travel to and from the candidate vehicle parking lot according to the road traffic network, the bus head and tail stations, the gas stations, the maintenance field and the geographic space information of the candidate vehicle parking lot (comprising the built third-party parking lot and the vacant land to be built) obtained in the step1, and calculating the minimum time cost based on the shortest path, wherein the minimum time cost of the buses of the bus head and tail stations i is as an example, and the minimum time cost of the buses of the bus head and tail stations i to travel to and from the vehicle parking lot j is as follows:
in the method, in the process of the invention, Representing the minimum time cost for a bus k needing to stop off-site to come and go to a candidate parking lot j at the first and last stops i of the bus,Representing the shortest network distance from the first station i to the last station i of the bus to the parking lot j of the candidate vehicle, and x representsIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x;
Step 2.2, aiming at the fuel bus, considering the condition that the bus needs to be refueled between the first and last stops of the back and forth bus and the vehicle parking lot, aiming at the first and last stops i of the bus and the vehicle parking lot j, according to road traffic network data, inquiring a filling station o with the minimum time cost at the point i and the point j, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the candidate station o,Representing the shortest distance path of the network from the candidate parking lot j to the candidate gas station o, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y;
Therefore, the minimum time cost of the bus k which needs to stop and protect in different places and goes to and from the vehicle parking lot j and passes through the stop filling station is as follows;
In the method, in the process of the invention, The minimum time cost of the bus k which needs to stop in different places to come and go to the candidate parking lot j and refuel in the process is represented by the bus head and tail stations i;
Step 2.3, aiming at the fuel vehicles and the electric vehicles, considering the condition that the buses need to be maintained between the first and last stops of the back and forth buses and the vehicle parking lot, aiming at the first and last stops i of the buses and the vehicle parking lot j, inquiring a maintenance field m with the minimum time cost at the i point and the j point according to road traffic network data, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the last station i of the bus to the candidate maintenance station m,Representing the shortest distance path of the network from the candidate parking lot j to the candidate maintenance field m, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y;
Therefore, the minimum time cost of the bus k needing to stop in different places and going to the vehicle parking lot j and stopping and maintaining field m at the first station and the last station i is as follows:
In the method, in the process of the invention, The minimum time cost of the bus k which needs to stop in different places to come and go to the candidate parking lot j and maintain in the process is represented by the bus head and tail stations i;
Step 2.4, aiming at the fuel vehicles, considering the condition that the buses need to be simultaneously refueled and maintained between the first and last buses and the vehicle parking lot, aiming at the first and last buses i and the vehicle parking lot j, inquiring the gas station o and the maintenance field m with the minimum time cost at the i point and the j point according to road traffic network data, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the filling station o or the candidate maintenance station m,Representing the network shortest distance path from candidate vehicle parking lot j to candidate service yard m or gas station o,Representing the shortest path distance between the filling station o and the maintenance yard m, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y, z representingIn the road section of the road(s),The travel speed of the road section z is represented,Representing the length of road segment z;
Therefore, the minimum time cost of the bus k needing to stop in different places at the first station and the last station i to go to and from the vehicle parking lot j and pass through the stop station o and the maintenance station m is as follows:
，
In the method, in the process of the invention, The minimum time cost of filling oil and maintaining in the process that a bus k needing to stop in different places goes to and from a candidate vehicle parking lot j is represented by a bus head and tail station i;
Preferably, the step3 includes:
Step 3.1, constructing 4 minimum time cost matrixes according to the minimum time cost of directly going to and from each bus head and tail station and a candidate vehicle parking lot in the city range obtained in the step 2 and the minimum time cost of going through a gas station and a maintenance field in the way of going to and from different types of buses;
step 3.2, obtaining the preference degree between the construction cost of the bus department to the vehicle parking lot and the time cost between the head and the tail of the bus and the vehicle parking lot from the bus department;
step 3.3, designing a composite cost optimal facility layout algorithm:
Wherein, the objective function adopts a CES function form; j represents the number of parking lots for the candidate vehicle; i represents the number of bus lines; p represents the number of fuel buses; e represents the number of electric buses; w represents preference of a bus company between construction cost of a vehicle parking lot and time cost between bus shuttle bus first and last stops and the vehicle parking lot; ρ is the utility substitution elasticity; representing construction and maintenance costs (reduced to annual average) of a newly built vehicle parking lot; representing rental costs for renting third party vehicle parking lots; And The vehicle parking lot is a 0-1 Boolean variable and is used for judging whether a candidate vehicle parking lot needs to be completely newly built or already exists; is a 0-1 boolean variable for judging whether the candidate parking lot is selected by the algorithm; The expected time cost between the bus k of the bus first and last station i and the bus parking lot j of the candidate bus is represented; The method is 0-1 Boolean variable, and is used for judging whether a bus k needing to park in different places at the first and last stops i of a bus selects a candidate vehicle parking station j as a vehicle parking lot; in the context of the constraints of the present invention, Representing the construction and maintenance costs of the newly built vehicle parking lot j from the construction costs per unit area of the candidate vehicle parking lot jBuilding areaDesign life cycleAnnual maintenance cost per unit areaAnd the cost of installing the charging terminalAnd charging terminal demandDetermining; Lease cost representing lease of third party vehicle parking lot from unit area of candidate vehicle parking lot And building areaAnd cost factor for retrofitting a charging terminalAnd charging terminal demandDetermining; the expected time cost between the fuel oil bus k of the bus first and last station i and the bus parking lot j of the candidate vehicleFrom time costs in four possible scenarios、、 Multiplying their respective occurrence probabilities to obtain a desired time cost between the round-trip bus head and tail of electric bus k and candidate parking lot jFrom time costs in two possible cases、Multiplied by each of them obtaining occurrence probability; Indicating that the bus can only park in the candidate parking lot which has been selected by the algorithm; The attribute representing a candidate vehicle parking lot must be one of newly built or existing; representing the number of parking lots of vehicles finally newly built or leased; Indicating that a bus can only stop in one candidate parking lot; representing the demand of vehicles parked in different places at the first station and the last station of the bus;
Step 3.4, calculating the optimal number of the vehicle parking lots and specific addresses according to an algorithm, and the parking lots of buses needing to be parked in different places at the head and the tail of each bus, so as to realize global optimization of the space positions of the vehicle parking lots and the vehicle parking arrangement;
preferably, the step4 includes:
step 4.1, importing a minimum time cost matrix containing 4 conditions of direct and stopped gas stations and maintenance fields between each bus head and tail station and a candidate vehicle parking lot in the city range obtained in the step 3.1;
Step 4.2, dividing the vehicle parking lot in the algorithm into two groups, wherein the phi group is a reserved station determined in the algorithm, the psi group is a candidate parking lot, and the preference degree between the construction cost of the vehicle parking lot and the time cost between the first and last stations of the bus and the vehicle parking lot is obtained from a public transportation department;
step 4.3, designing a composite cost optimal facility layout algorithm:
In the method, in the process of the invention, Indicating that phi group stations must provide parking service for buses, and whether psi group stations provide service is controlled by an algorithm;
Step 4.4, running an algorithm, and calculating to obtain the optimal number of newly-increased vehicle parking lots ，And the space position of the bus and the parking lot of the bus which needs to park in different places at the head and the tail of each newly added bus realize the local optimization of the space position of the parking lot of the vehicle and the arrangement of the parking in different places of the vehicle.
The invention calculates and obtains the minimum cost distance matrix between the bus head and the bus terminal and the candidate vehicle parking lot based on city traffic network data, and respectively builds the minimum cost distance matrix between the bus head and the bus terminal and the candidate vehicle parking lot on the basis of the preference between the direct and the stop service station, the stop service field, the direct and the stop service field, the minimum cost path between the bus head and the bus terminal and the candidate vehicle parking lot, the minimum cost distance matrix between the bus head and the bus terminal and the candidate vehicle parking lot, the fueling and maintenance probability in the process of calculating the different-place parking requirements of the bus head and the terminal, the bus to and the bus parking lot, the construction cost (comprising the newly built and reconstruction cost of a charging terminal) of a bus department and the time cost of the vehicle to and the bus parking lot, the method comprises the steps of constructing a global optimization algorithm of a facility layout with optimal composite cost, planning the required quantity and the space layout of the whole urban bus parking lot, calculating the optimal quantity and the optimal site selection of the bus parking lots under the new energy background of a bus route, arranging the parking of different types of vehicles at the first and the last buses under the result, further providing a local optimization algorithm on the basis, optimizing the condition of reserving a part of the existing bus parking lots to newly add the vehicle parking lots so as to reduce the passing cost of the vehicles, and obtaining the optimal quantity and the optimal site selection of the newly added parking lots and the off-site parking arrangement of the vehicles.
The invention has the advantages that: based on road network data and public transportation line daily operation data, the global/local optimal vehicle parking lot demand quantity and the position selection thereof are rapidly and effectively calculated, the parking lot arrangement of vehicles is provided, and scientific basis is provided for the facility position selection of a public transportation system.
Drawings
FIG. 1 vehicle parking lot most preferred site;
FIG. 2 adds a vehicle parking lot optimal site;
Fig. 3 is a general flow chart.
Detailed Description
In order to make the invention more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Step 1, acquiring the space position, capacity, construction cost and the like related to a public transportation vehicle parking lot from an urban management department and a public transportation system management department, acquiring the information of the position, operation line, vehicles in a volume and the like related to the first and last stations of a public transportation line, and basic data such as urban land utilization data, hierarchical road network data and the like, firstly calculating the parking demands of different places, and calculating the probability of needing to be filled and maintained in the process of going to the first and last stations of the public transportation vehicle and the vehicle parking lot and the charging demands in the parking lot according to the existing vehicle filling, charging and maintaining frequency;
Step 1.1, land utilization data and hierarchical road network data of a city are obtained from a city management department, wherein the land utilization data comprise land types, construction cost, areas and space positions of empty land blocks which can be constructed in the range of a city domain, the constructed parking lot information data comprise facility capacity and rent, the gas station information capable of providing services comprises gas station names and space positions, and the road traffic information data comprise road starting and ending points, road levels and traffic speeds;
in this example, land utilization data obtained from city management departments are shown in table 1, information of an established parking lot is shown in table 2, road traffic information data is shown in table 3a, and road traffic node information data is shown in table 3b;
TABLE 1 land use data
Table 2 built parking lot information data
Table 3a road traffic information data
Table 3b road traffic node information data
Step 1.2, acquiring urban bus lines and vehicle information data of each line from a bus management department, wherein the vehicle information data comprises the first and last station positions of each bus line, the parking capacity of daily different types of buses in the line in order to operate the vehicles, and the first and last stations of the line, and calculating the vehicle parking requirements of each bus in different placesFor an electric bus, according to the number of existing charging terminals at the head and the tail of the bus, calculating the charging terminal requirements for stopping vehicles at different places at the head and the tail of each bus ：
In the method, in the process of the invention,The fuel buses at the first and last stations i of the bus are in the album for operating the vehicles,The electric buses of the first and last stations i of the bus are used for operating the vehicles in a volume,Is the parking area in the first and last stations i of the bus, kappa is the parking area of one bus,The number of charging terminals of the first station and the last station i of the bus is represented;
in this example, the requirements of the vehicle parking and charging terminals at different places at the head and the tail of each bus are shown in table 4:
TABLE 4 demand for stopping vehicles at different places at first and last stops of bus
Step 1.3, inquiring a land block suitable for being used as a parking lot of a bus as a candidate facility point position according to the demand characteristics of the bus for parking in different places and the distance from the nearest bus head station to the nearest bus tail station and the land block area, wherein the method comprises the steps of utilizing the existing parking lot and completely creating a new parking lot, and calculating the construction cost of the new parking lot according to the land price of the land block;
in this example, assuming that the upper limit of the distance from the land to the nearest bus head and tail station is 5 km, the lower limit of the land area is 2000 square meters, the construction cost of the candidate new parking lot is shown in table 5:
TABLE 5 construction costs of New parking lots
| ID | Construction cost | Area of | Total price | X | Y |
| …… | …… | …… | …… | …… | …… |
| M110 | 4600.44 Yuan/square meter | 2213.02 Square meters | 1018.09 Ten thousand yuan | 122.0054 | 32.0866 |
| M111 | 3850.84 Yuan/square meter | 3602.62 Square meters | 1387.31 Ten thousand yuan | 121.5656 | 31.6728 |
| M112 | 5491.35 Yuan/square meter | 3804.14 Square meters | 2088.99 Ten thousand yuan | 122.1985 | 32.8201 |
| M113 | 3931.18 Yuan/square meter | 3889.35 Square meters | 1528.97 Ten thousand yuan | 122.1234 | 33.0258 |
| M114 | 4894.91 Yuan/square meter | 3776.92 Square meters | 1848.77 Ten thousand yuan | 122.0252 | 31.7746 |
| M115 | 5197.10 Yuan/square meter | 3505.97 Square meters | 1822.09 Ten thousand yuan | 121.7405 | 32.4667 |
| M116 | 5742.50 Yuan/square meter | 3200.49 Square meters | 1837.88 Ten thousand yuan | 123.0667 | 32.8038 |
| M117 | 5837.58 Yuan/square meter | 3178.75 Square meters | 1855.62 Ten thousand yuan | 121.7267 | 31.3643 |
| M118 | 4326.12 Yuan/square meter | 2683.64 Square meters | 1160.97 Ten thousand yuan | 123.4611 | 31.7635 |
| M119 | 6068.96 Yuan/square meter | 2606.50 Square meters | 1581.87 Ten thousand yuan | 123.0493 | 33.0444 |
| M120 | 4782.52 Yuan/square meter | 3394.83 Square meters | 1623.58 Ten thousand yuan | 122.5404 | 32.9802 |
| M121 | 4660.81 Yuan/square meter | 2257.65 Square meters | 1052.25 Ten thousand yuan | 122.2843 | 32.3461 |
| M122 | 5493.87 Yuan/square meter | 2070.32 Square meters | 1137.41 Ten thousand yuan | 122.0211 | 32.2103 |
| M123 | 5387.84 Yuan/square meter | 2277.05 Square meters | 1226.84 Ten thousand yuan | 122.0556 | 31.6154 |
| M124 | 5724.29 Yuan/square meter | 3220.36 Square meters | 1843.43 Ten thousand yuan | 123.3685 | 32.4756 |
| M125 | 5676.00 Yuan/square meter | 2719.64 Square meters | 1543.67 Ten thousand yuan | 121.9274 | 31.2838 |
| …… | …… | …… | …… | …… | …… |
Step 1.4, acquiring daily refueling and maintenance frequency of buses belonging to each bus route from a bus management department, and calculating the probability of needing to refuel in a single round trip parking lot of the buses and in the first and last stops of the busesProbability of need for maintenanceAnd the probability of requiring both refuelling and maintenance：
Wherein i represents a bus route, k represents a bus which needs to stop in different places,Indicating the number of bus reservations on bus line i,Indicating the number of average fueling times per day for bus k,Representing the daily average maintenance times of the bus k;
In this example, the probability that each bus needs to be refueled and maintained every day is shown in table 6:
table 6 probability of daily filling and maintenance of bus
Step 2, calculating the minimum cost distance of the bus in the road traffic network by taking the passing time as the cost aiming at the head and the tail of each bus route and the parking lot of the candidate bus, and respectively calculating the minimum cost distance of the bus by considering 4 possible situations that the bus directly goes to and from the head and the tail and the parking lot, the bus is refueled in the round trip process, the bus is maintained in the round trip process, and the bus is refueled and maintained simultaneously in the round trip process;
Step 2.1, calculating the shortest path of the buses of each bus head and tail station to directly travel to and from the candidate vehicle parking lot according to the road traffic network, the bus head and tail stations, the gas stations, the maintenance field and the geographic space information of the candidate vehicle parking lot (comprising the built third-party parking lot and the vacant land to be built) obtained in the step1, and calculating the minimum time cost based on the shortest path, wherein the minimum time cost of the buses of the bus head and tail stations i is as an example, and the minimum time cost of the buses of the bus head and tail stations i to travel to and from the vehicle parking lot j is as follows:
In the method, in the process of the invention, Representing the minimum time cost for a bus k needing to stop off-site to come and go to a candidate parking lot j at the first and last stops i of the bus,Representing the shortest network distance from the first station i to the last station i of the bus to the parking lot j of the candidate vehicle, and x representsIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x;
in this example, the minimum time cost for the bus head and tail stations to directly travel to and from the candidate parking lot is shown in table 7:
TABLE 7 minimum time cost for bus head and end stops to directly shuttle candidate car park
Step 2.2, aiming at the fuel bus, considering the condition that the bus needs to be refueled between the first and last stops of the back and forth bus and the vehicle parking lot, aiming at the first and last stops i of the bus and the vehicle parking lot j, according to road traffic network data, inquiring a filling station o with the minimum time cost at the point i and the point j, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the candidate station o,Representing the shortest distance path of the network from the candidate parking lot j to the candidate gas station o, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y;
therefore, the bus k needing to stop in different places at the first station and the last station i of the bus, the bus k going to and from the parking station j of the vehicle and the minimum time cost of the parking station is;
In the method, in the process of the invention, The minimum time cost of the bus k which needs to stop in different places to come and go to the candidate parking lot j and refuel in the process is represented by the bus head and tail stations i;
In this example, the minimum time cost for going to and from the bus head and tail to the candidate parking lot and fueling is shown in table 8:
TABLE 8 minimum time cost for bus head and end stops to come and go to candidate parking lot and refuel
Step 2.3, aiming at the fuel vehicles and the electric vehicles, considering the condition that the buses need to be maintained between the first and last stops of the back and forth buses and the vehicle parking lot, aiming at the first and last stops i of the buses and the vehicle parking lot j, inquiring a maintenance field m with the minimum time cost at the i point and the j point according to road traffic network data, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the last station i of the bus to the candidate maintenance station m,Representing the shortest distance path of the network from the candidate parking lot j to the candidate maintenance field m, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y;
Therefore, the minimum time cost of the bus k needing to stop in different places and going to the vehicle parking lot j and stopping and maintaining field m at the first station and the last station i is as follows:
In the method, in the process of the invention, The minimum time cost of the bus k which needs to stop in different places to come and go to the candidate parking lot j and maintain in the process is represented by the bus head and tail stations i;
In this example, the minimum time cost for going to and from the bus head and tail to the candidate parking lot and for maintenance is shown in table 9:
TABLE 9 minimum time cost for bus head and end stops to come to and go to candidate parking lot and repair
| Station ID | Parking lot ID | Minimum time cost (minutes) |
| …… | …… | …… |
| S1 | M1 | 39.16 |
| S1 | M2 | 35.94 |
| S1 | M3 | 38.78 |
| S1 | M4 | 30.41 |
| S1 | M5 | 28.56 |
| S1 | M6 | 30.51 |
| S1 | M7 | 39.60 |
| …… | …… | …… |
Step 2.4, aiming at the fuel vehicles, considering the condition that the buses need to be simultaneously refueled and maintained between the first and last buses and the vehicle parking lot, aiming at the first and last buses i and the vehicle parking lot j, inquiring the gas station o and the maintenance field m with the minimum time cost at the i point and the j point according to road traffic network data, and meeting the following conditions:
In the method, in the process of the invention, Representing the shortest distance path of the network from the first station i to the filling station o or the candidate maintenance station m,Representing the network shortest distance path from candidate vehicle parking lot j to candidate service yard m or gas station o,Representing the shortest path distance between the filling station o and the maintenance yard m, x representingIn the road section of the road(s),The travel speed of the road segment x is represented,Representing the length of the road segment x, y representingIn the road section of the road(s),The travel speed of the road section y is represented,Representing the length of the road section y, z representingIn the road section of the road(s),The travel speed of the road section z is represented,Representing the length of road segment z;
Therefore, the minimum time cost of the bus k needing to stop in different places at the first station and the last station i to go to and from the vehicle parking lot j and pass through the stop station o and the maintenance station m is as follows:
In the method, in the process of the invention, The minimum time cost of filling oil and maintaining in the process that a bus k needing to stop in different places goes to and from a candidate vehicle parking lot j is represented by a bus head and tail station i;
In this example, the minimum time costs for going to and from the bus head and tail to the candidate parking lot and for refueling and maintenance are shown in Table 10:
TABLE 10 minimum time cost for bus head and end stops to come and go to candidate parking lot and refuel and repair maintenance
| Station ID | Parking lot ID | Minimum time cost (minutes) |
| …… | …… | …… |
| S1 | M1 | 34.46 |
| S1 | M2 | 45.86 |
| S1 | M3 | 42.79 |
| S1 | M4 | 32.57 |
| S1 | M5 | 39.84 |
| S1 | M6 | 34.19 |
| S1 | M7 | 34.77 |
| …… | …… | …… |
Step 3, establishing a minimum cost distance matrix, designing a composite cost optimal facility layout algorithm on the basis, comprehensively considering the time cost between a daily bus round-trip parking lot and a bus head-end station and the construction and maintenance cost of the parking lot and a charging terminal thereof under the condition of giving an electric proportion of a bus, and realizing optimal selection of the number and the space position of the parking lot of the bus;
Step 3.1, constructing 4 minimum time cost matrixes according to the minimum time cost of directly going to and from each bus head and tail station and a candidate vehicle parking lot in the city range obtained in the step 2 and the minimum time cost of going through a gas station and a maintenance field in the way of going to and from different types of buses;
In this example, the minimum time cost matrix of the fuel bus first and last stops directly going to and from the candidate parking lot under 4 conditions is shown in table 11, table 12, table 13 and table 14:
table 11 minimum time cost matrix for bus head and tail stations to directly travel to and from candidate parking lot
| ID | M11 | M12 | M13 | M14 | M15 | …… |
| …… | …… | …… | …… | …… | …… | …… |
| S11 | 10.27 | 20.31 | 11.80 | 16.42 | 16.41 | …… |
| S12 | 21.19 | 16.82 | 29.33 | 23.09 | 20.67 | …… |
| S13 | 25.38 | 14.62 | 26.21 | 26.57 | 11.91 | …… |
| S14 | 25.78 | 23.80 | 16.08 | 24.27 | 21.89 | …… |
| S15 | 21.39 | 13.47 | 13.97 | 21.70 | 29.57 | …… |
| …… | …… | …… | …… | …… | …… | …… |
Table 12 minimum time cost matrix for bus head and tail stations to come and go to candidate car parking lot and refuel
| ID | M11 | M12 | M13 | M14 | M15 | …… |
| …… | …… | …… | …… | …… | …… | …… |
| S11 | 12.19 | 23.45 | 15.39 | 19.19 | 18.97 | …… |
| S12 | 21.62 | 17.82 | 32.72 | 25.06 | 24.15 | …… |
| S13 | 29.64 | 18.27 | 26.94 | 30.54 | 15.70 | …… |
| S14 | 26.76 | 25.12 | 19.83 | 25.48 | 23.06 | …… |
| S15 | 21.96 | 15.49 | 16.72 | 25.41 | 32.01 | …… |
| …… | …… | …… | …… | …… | …… | …… |
Table 13 minimum time cost matrix for bus head and tail stops to come and go to candidate parking lot and maintain
| ID | M11 | M12 | M13 | M14 | M15 | …… |
| …… | …… | …… | …… | …… | …… | …… |
| S11 | 14.00 | 25.42 | 19.98 | 22.88 | 21.50 | …… |
| S12 | 25.51 | 18.50 | 37.71 | 29.14 | 25.19 | …… |
| S13 | 32.96 | 21.17 | 27.76 | 33.50 | 16.19 | …… |
| S14 | 29.15 | 29.02 | 20.42 | 29.21 | 23.44 | …… |
| S15 | 25.97 | 15.93 | 21.48 | 29.59 | 33.62 | …… |
| …… | …… | …… | …… | …… | …… | …… |
Table 14 minimum time cost matrix for bus head and tail stations to travel to and from candidate parking lot and for fueling and maintenance
| ID | M11 | M12 | M13 | M14 | M15 | …… |
| …… | …… | …… | …… | …… | …… | …… |
| S11 | 14.38 | 30.14 | 23.40 | 24.38 | 27.17 | …… |
| S12 | 25.59 | 24.44 | 38.95 | 30.60 | 31.17 | …… |
| S13 | 33.82 | 21.71 | 34.22 | 36.46 | 23.44 | …… |
| S14 | 37.78 | 37.72 | 20.60 | 37.17 | 31.31 | …… |
| S15 | 26.42 | 24.58 | 24.52 | 29.95 | 35.05 | …… |
| …… | …… | …… | …… | …… | …… | …… |
Step 3.2, obtaining the preference degree between the construction cost of the bus department to the vehicle parking lot and the time cost between the head and the tail of the bus and the vehicle parking lot from the bus department;
step 3.3, designing a composite cost optimal facility layout algorithm:
Wherein, the objective function adopts a CES function form; j represents the number of parking lots for the candidate vehicle; i represents the number of bus lines; p represents the number of fuel buses; e represents the number of electric buses; w represents preference of a bus company between construction cost of a vehicle parking lot and time cost between bus shuttle bus first and last stops and the vehicle parking lot; ρ is the utility substitution elasticity; representing construction and maintenance costs (reduced to annual average) for a newly built vehicle parking station; representing rental costs for renting third party vehicle parking lots; And The vehicle parking lot is a 0-1 Boolean variable and is used for judging whether a candidate vehicle parking lot needs to be completely newly built or already exists; is a 0-1 boolean variable for judging whether the candidate parking lot is selected by the algorithm; The expected time cost between the bus k of the bus first and last station i and the bus parking lot j of the candidate bus is represented; The method is 0-1 Boolean variable, and is used for judging whether a bus k needing to park in different places at the first and last stops i of a bus selects a candidate vehicle parking lot j as a vehicle parking lot; in the context of the constraints of the present invention, Representing the construction and maintenance costs of the newly built vehicle parking lot j from the construction costs per unit area of the candidate vehicle parking lot jBuilding areaDesign life cycleAnnual maintenance cost per unit areaAnd the cost of installing the charging terminalAnd charging terminal demandDetermining; Lease cost representing lease of third party vehicle parking lot from unit area of candidate vehicle parking lot And building areaAnd cost factor for retrofitting a charging terminalAnd charging terminal demandDetermining; the expected time cost between the fuel oil bus k of the bus first and last station i and the bus parking lot j of the candidate vehicleFrom time costs in four possible scenarios、、、Multiplying their respective occurrence probabilities to obtain a desired time cost between the round-trip bus head and tail of electric bus k and candidate parking lot jFrom time costs in two possible cases、Multiplied by each of them obtaining occurrence probability; Indicating that the bus can only park in the candidate parking lot which has been selected by the algorithm; The attribute representing a candidate vehicle parking lot must be one of newly built or existing; representing the number of parking lots of vehicles finally newly built or leased; Indicating that a bus can only stop in one candidate parking lot; representing the demand of vehicles parked in different places at the first station and the last station of the bus;
In this example, assume that the preference is 0.75;
Step 3.4, calculating the optimal number of the vehicle parking lots and specific addresses according to an algorithm, and the parking lots of buses needing to be parked in different places at the head and the tail of each bus, so as to realize global optimization of the space positions of the vehicle parking lots and the vehicle parking arrangement;
In this example, the number of parking lots at different places is 15, the most preferred sites of the parking lots of vehicles are shown in fig. 1, and the arrangement of the parking lots at different places of vehicles is shown in table 15:
Table 15 off-site parking schedule for vehicles at head and tail stations of buses
| Bus head and end station ID | Bus ID | Parking lot ID |
| …… | …… | |
| S1 | B1 | M2 |
| S1 | B2 | M2 |
| S1 | B3 | M2 |
| S2 | B4 | M2 |
| S2 | B5 | M2 |
| …… | …… |
Step 4, aiming at the problems of further adding stations and reducing cost of local optimization on the basis of the construction of the original bus parking lot, improving on the basis of the algorithm designed in the step 3, designing a local bus parking lot site selection layout optimization algorithm, and adding a certain number of parking lots on the basis of the original bus parking lot layout to reduce the commuting cost of buses and realize local improvement of the space layout of the bus parking lot; :
Step 4.1, importing a minimum time cost matrix containing 4 conditions of direct and stopped gas stations and maintenance fields between each bus head and tail station and a candidate vehicle parking lot in the city range obtained in the step 3.1; ;
Step 4.2, dividing the vehicle parking lot in the algorithm into two groups, wherein the phi group is a reserved station determined in the algorithm, the psi group is a candidate parking lot, and the preference degree between the construction cost of the vehicle parking lot and the time cost between the first and last stations of the bus and the vehicle parking lot is obtained from a public transportation department;
step 4.3, designing a composite cost optimal facility layout algorithm:
In the method, in the process of the invention, Indicating that phi group stations must provide parking service for buses, and whether psi group stations provide service is controlled by an algorithm;
In this example, assume that the preference is 0.75;
Step 4.4, running an algorithm, and calculating to obtain the optimal number of newly-increased vehicle parking lots ，And the space position of the bus and the parking lot of the bus which needs to park in different places at the head and the tail of each newly added bus realize the local optimization of the space position of the parking lot of the vehicle and the arrangement of the parking in different places of the vehicle.
In this example, the number of the calculated newly added parking lots of vehicles is 2, the most preferred addresses are shown in fig. 2, and the updated parking schedule of vehicles at different places is shown in table 16:
off-site parking arrangement for vehicles at head and tail stations of buses with updated table 16
| Bus head and end station ID | Bus ID | Parking lot ID |
| …… | …… | |
| S1 | B1 | M2 |
| S1 | B2 | M2 |
| S1 | B3 | M2 |
| S2 | B4 | M7 |
| S2 | B5 | M7 |
| …… | …… |
Claims (3)
1. The method for selecting the addresses of the bus parking lots based on the expected driving cost is characterized by comprising the following steps of:
step 1, basic data including urban hierarchical road traffic network data are obtained from urban management departments and public transportation system management departments; acquiring the space position, parking capacity and construction cost of a candidate bus parking lot; acquiring the space position and parking capacity of an existing bus parking lot and the cost of reconstruction of a charging terminal; acquiring the space positions of the first and the last stations of the bus route, calculating the in-album operation vehicles of the buses according to the departure volume of the bus route to which the bus route belongs, and further calculating the vehicle parking demands of the buses at the first and the last stations in different places; according to the daily refueling, charging and vehicle maintenance frequency of the buses of the bus route, calculating the probability of needing refueling and vehicle maintenance in the process of going to the first and last stops of the buses and the vehicle parking lot and the charging requirement in the parking lot;
Step 2, calculating the minimum cost distance of the bus in the road traffic network by taking the passing time as the cost aiming at the head and the tail of each bus route and the parking lot of the candidate bus, and respectively calculating the minimum cost distance of the bus by considering 4 possible situations that the bus directly goes to and from the head and the tail and the parking lot, the bus is refueled in the round trip process, the bus is maintained in the round trip process, and the bus is refueled and maintained simultaneously in the round trip process;
Step 3, a minimum cost distance matrix is established, a composite cost optimal facility layout algorithm is designed on the basis, under the condition of given bus electrodynamic proportion, the time cost between a daily bus round trip parking lot and a bus head and tail station and the construction and maintenance costs of the parking lot and a charging terminal thereof are comprehensively considered, optimal selection of the number and space positions of the bus parking lot is realized, according to the minimum time cost of directly round trip each bus head and tail station and a candidate vehicle parking lot in a city range and the minimum time cost of passing through a gas station and a maintenance field in round trip of different types of buses, 4 minimum time cost matrixes are constructed, a facility area site selection model of the bus in a different place parking lot is established, the model is compounded in a CES function mode, the minimum time cost of refueling and maintenance commute and the parking lot construction cost is an optimal target, the partial coefficient of CES composite between the vehicle parking lot construction cost and the time cost between the bus round trip head and tail station and the vehicle parking lot can be obtained from a department of the bus parking lot, the number of the new bus in the new place and the parking lot of the bus in a constraint condition is controlled by 0-1 Boolean variable, and the space of the bus in the whole parking lot is required to be selected, and the parking space of the bus in the optimal parking lot is realized;
And 4, aiming at the problem of local optimization of further adding a station and reducing cost on the basis of the construction of the original bus parking lot, based on the minimum time cost matrix of the city range obtained in the step 3 and under 4 conditions including a direct station and a stop station and a maintenance station and obtaining the preference coefficient of the bus parking lot between the construction cost of the bus parking lot and the time cost between the bus round trip station and the bus parking lot from a public department, modifying the site selection algorithm of the bus parking lot facility, dividing the parking lot into two types of the existing and determined reserved and candidate parking lots, and simultaneously combining the cost of the newly added parking lot and the commuting cost of the bus in a CES form as optimization targets, ensuring that the reserved parking lot is in the operation state by externally locking the operation state of the determined parking lot, optimizing the new construction of the bus parking lot and the schedule of the bus in the different place under the optimal cost, and calculating the optimization of the number and the position of the newly added parking lot.
2. The method for selecting the parking lot of the bus based on the expected running cost according to claim 1, wherein the step 1 is based on data bases obtained by a city management department and a bus system management department, calculates the total off-site parking requirement and the charging terminal requirement through the head-end station on-book vehicles and parking capacity, and calculates the probability P i,o that the bus needs to be refueled, the probability P i,m that the bus needs to be refueled and the probability P i,o,m that the bus needs to be refueled and the bus needs to be maintained at the same time through daily refueled and maintenance frequency of the buses of each bus line.
3. The method for selecting the address of the bus parking lot based on the expected running cost according to claim 1, wherein the step 2 calculates the shortest path between facilities according to the road traffic network, the gas station, the maintenance site and the geographical space information of the candidate bus parking lot, and accumulates the time consumption of each road section in the shortest path, namely the ratio of the length d of the road section to the running speed s of the road section, so as to obtain the minimum time cost of the bus at the head and the tail of each bus in four conditions of direct shuttle, midway refueling, midway maintenance and the maintenance to the candidate bus parking lot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111088365.0A CN113780851B (en) | 2021-09-16 | 2021-09-16 | Bus parking lot address selection method based on expected driving cost |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111088365.0A CN113780851B (en) | 2021-09-16 | 2021-09-16 | Bus parking lot address selection method based on expected driving cost |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113780851A CN113780851A (en) | 2021-12-10 |
| CN113780851B true CN113780851B (en) | 2024-04-26 |
Family
ID=78851470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111088365.0A Active CN113780851B (en) | 2021-09-16 | 2021-09-16 | Bus parking lot address selection method based on expected driving cost |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113780851B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107153893A (en) * | 2017-05-19 | 2017-09-12 | 东南大学 | A kind of electric automobile charging station Site planning method based on city parking data |
| CN109035770A (en) * | 2018-07-31 | 2018-12-18 | 上海世脉信息科技有限公司 | The real-time analyzing and predicting method of public transport passenger capacity under a kind of big data environment |
| CN110288212A (en) * | 2019-06-14 | 2019-09-27 | 石家庄铁道大学 | Electric taxi based on improved MOPSO creates charging station site selecting method |
| CN112750063A (en) * | 2021-01-04 | 2021-05-04 | 李璐 | Bus fleet facility site selection-path planning-scheduling method based on random planning |
-
2021
- 2021-09-16 CN CN202111088365.0A patent/CN113780851B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107153893A (en) * | 2017-05-19 | 2017-09-12 | 东南大学 | A kind of electric automobile charging station Site planning method based on city parking data |
| CN109035770A (en) * | 2018-07-31 | 2018-12-18 | 上海世脉信息科技有限公司 | The real-time analyzing and predicting method of public transport passenger capacity under a kind of big data environment |
| CN110288212A (en) * | 2019-06-14 | 2019-09-27 | 石家庄铁道大学 | Electric taxi based on improved MOPSO creates charging station site selecting method |
| CN112750063A (en) * | 2021-01-04 | 2021-05-04 | 李璐 | Bus fleet facility site selection-path planning-scheduling method based on random planning |
Non-Patent Citations (2)
| Title |
|---|
| 公交停保场选址评价研究;洪治潮;胡登金;冯晓梅;蒋蓉;郭超杰;;综合运输(第09期);36-40 * |
| 城市公交停保场选址模型研究;周长杰等;交通运输研究;第4卷(第1期);28-34 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113780851A (en) | 2021-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102722767B (en) | Electromobile charging and exchanging power station stationing and planning system and method | |
| CN107798867B (en) | Congestion traffic network balancing method based on electric automobile and diesel locomotive mixed traffic flow | |
| CN111915150B (en) | Electric bus system planning method | |
| CN106965688A (en) | A kind of charging electric vehicle method under power network and the network of communication lines cooperative surroundings | |
| Hwang et al. | Infrastructure development for alternative fuel vehicles on a highway road system | |
| CN115455681A (en) | Multi-vehicle-oriented commuting traffic carbon emission spatial distribution estimation method | |
| CN111626469A (en) | Fast and slow vehicle driving optimization method for transportation energy promotion | |
| CN107145983A (en) | A kind of electric automobile charging station site selecting method based on city virtual traffic platform | |
| Yatskiv et al. | Evaluating Riga transport system accessibility | |
| Golla et al. | Vehicle scheduling and refueling of hydrogen buses with on-site electrolysis | |
| CN113780851B (en) | Bus parking lot address selection method based on expected driving cost | |
| CN112289065B (en) | Customized bus route design method and system based on accurate OD big data | |
| CN112487587A (en) | Point-line-plane comprehensive layout-based public charging facility site selection method | |
| Janoš et al. | Smart urban transport | |
| CN112070334A (en) | Multi-intelligent-theory-based charging and battery-changing station coordination planning method and system | |
| CN113420439B (en) | Comprehensive traffic bearing capacity calculation method, device, computer equipment and storage medium | |
| CN111832882B (en) | Traffic control method and device, storage medium and electronic equipment | |
| Deb et al. | Comprehensive Review of Planning Models for Charging Station Placement | |
| Kweon et al. | Intersection of a continuous 1-location problem on a tree network | |
| Chen et al. | Research on Location of Shared Car Rental Outlet: Taking CD City as an Example | |
| CN112350334B (en) | Power supply method of comprehensive parking lot charging facility | |
| CN115323850B (en) | Road network planning method for narrow road dense road network | |
| Haijian et al. | Route Planning of Customizable and Cruising Autonomous Bus in CAV Environment | |
| YAMAMOTO et al. | Socioeconomic evaluation of transit oriented development using a Detailed Spatial Scale CUE Model in Taiwan | |
| Kosherbay et al. | Analysis of the state of public transport in Almaty |
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 |