CN105956687A - Traffic network planning method capable of decreasing ineffective traffic - Google Patents
Traffic network planning method capable of decreasing ineffective traffic Download PDFInfo
- Publication number
- CN105956687A CN105956687A CN201610255729.2A CN201610255729A CN105956687A CN 105956687 A CN105956687 A CN 105956687A CN 201610255729 A CN201610255729 A CN 201610255729A CN 105956687 A CN105956687 A CN 105956687A
- Authority
- CN
- China
- Prior art keywords
- traffic
- transportation
- node
- mode
- planning method
- 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.)
- Pending
Links
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a traffic network planning method capable of decreasing ineffective traffic. The method comprises steps of determining traffic network nodes in a planned area; acquiring the weight allocation of different traffic modes according to acquired traffic demand information; and planning a traffic mode among the traffic network nodes in the planned area according to the weight allocation. The traffic network planning method capable of decreasing ineffective traffic plans the traffic network in virtue of seamless connection, comprehensively considers different traffic modes according to traffic demands with the purpose of a decrease in ineffective traffic, keeps the number of transfer times and walking distance to a minimum, increases transport efficiency, greatly decreases ineffective traffic, achieves seamless connection of passengers and freights among different transport modes, shortens operation time, coordinates various transport modes, prevents the independent and dispersive disadvantage of a conventional transport mode, plans a road network scheme with multiple objectives, and really optimizes the planning scheme.
Description
Technical field
The present invention relates to traffic programme field, particularly relate to a kind of Transportation Network Planning method that nullified traffic reduces.
Background technology
Raising along with China's economic level, the living standard of people is significantly improved, the quantity of vehicle increases severely year by year, and the construction speed of means of transportation has lagged far behind the growth rate of automobile accordingly, being continuously increased along with transport need, expanding of Road Network Capacity is built always not as good as the growth of traffic flow, and therefore, transportation network of making rational planning for is particularly important.Existing transportation planning method is broadly divided into following two: Four-stage Method and volumetric method.Four-stage Method is, by Trip generation forecast, traffic distribution, the selection of mode of transportation, traffic flow four steps of distribution, road network flow in planning region is carried out the planning in target year.Volumetric method is that the heap(ed) capacity restriction according to road network bottleneck controls road network assignment of traffic, is generally used for the planning of bridge tunnel, has certain limitation.And it is less to implement programme with the object of planning, the object of planning is single.Although above-mentioned planning is to plan with transport need, but it is all to carry out capital construction with respective Transportation Organization requirement, make various forms of transport independence, dispersion, lack total tune, means of transportation linking is unreasonable, transport resource is caused to be wasted, conevying efficiency is low, invalid traffic increases, not only create substantial amounts of unnecessary traffic generating capacity, also create the meaningless consumption of the various energy, therefore, need a kind of new Transportation Network Planning method badly, make transportation network in the limited time and spatially improve the running efficiency of road network, linkage function and service level.
Summary of the invention
In view of this, the present invention provides a kind of Transportation Network Planning method that nullified traffic reduces, and to reduce invalid traffic as target, reduces the transport resource waste in existing programme, the inefficient shortcoming of elm.
The Transportation Network Planning method that a kind of nullified traffic that the present invention provides reduces, including
Determine the transportation network node in planning region according to planning region, the weight of the transport need acquisition of information difference mode of transportation by gathering is distributed, according to the internodal mode of transportation of transportation network in described weight distribution planning region.
Further, mode of transportation between also including according to node obtains the efficiency parameter under corresponding mode of transportation, set up seamless connection goal constraint function, the best route between being obtained between any two node in planning region by described seamless connection goal constraint function.
Further, described efficiency parameter includes the haulage time under corresponding mode of transportation and infusion of financial resources, and described seamless connection goal constraint function is represented by equation below:
Pj=α Tj+ β Mj,
Wherein: Pj is constraint function, Tj is the haulage time in section between node i and node j, and Mj is the infusion of financial resources in section；
Tj≤Tmax, Tmax are the longest permission in section haulage time between node i and node j,
Mj≤Mmax, Mmax are that between node i and node j, section allows maximum infusion of financial resources；
Further, by the seamless connection goal constraint function of relatively each route, the minimum Pj value in the multiple route of different mode of transportation is obtained, according to minimum Pj value optimum scheme comparison.
Further, described transport need information is obtained by traffic census, and described traffic census includes that the investigation of Urban Passenger Traffic amount and traffic flow are investigated, and is obtained by described traffic census and traffic attraction occurs, determine the station scale of node.
Further, described node includes that starting point, turning point and terminal, described mode of transportation include railway transportation, highway transportation, water-borne transport, air transportation and rail transport.
Further, described efficiency parameter also includes the speed of service, freight volume and handling capacity of passengers, determines the weight of different mode of transportation, and sets up Analytic Hierarchy Process Model, obtains weight vectors by described Analytic Hierarchy Process Model.
Further, obtained by following formula and allow infusion of financial resources,
Wherein, m represents the number of node, MijRepresent node i to the gross investment between node j, F represents that permission is injected capital into.
Further, by the investigation of described Urban Passenger Traffic amount obtain terminal distribution, trip mode, away from discrete time, by described traffic flow investigation acquisition shipping people, shipment amount, goods dealing amount and transportation trade.
Further, the generation traffic attraction obtained according to described traffic census, is classified in the node station of each for transportation network mode of transportation, obtain the weight that the classification of each mode of transportation is corresponding.
Beneficial effects of the present invention: the Transportation Network Planning method that a kind of nullified traffic in the present invention reduces uses seamless connection to plan transportation network, for the purpose of reducing invalid traffic, according to transport need, different means of transportation is considered, make number of transfer minimum, walking distance is the shortest, not only increase traffic transportation efficiency, also greatly reduce invalid traffic, make traveller, source of goods seamless connection between this different types of means of transportation, save the operation time, the present invention is by the various forms of transport coordinating and unifying, the shortcoming avoiding existing Traditional Transportation mode independent dispersion, the present invention carrys out planned road network scheme with multiple target, it is truly realized the optimization of programme.
Accompanying drawing explanation
The invention will be further described with embodiment below in conjunction with the accompanying drawings:
Fig. 1 is the principle schematic of the present invention.
Fig. 2 is that the website of the present invention selects schematic diagram.
Detailed description of the invention
The invention will be further described with embodiment below in conjunction with the accompanying drawings: Fig. 1 is the principle schematic of the present invention, and Fig. 2 is that the website of the present invention selects schematic diagram.
As shown in Figure 1, the Transportation Network Planning method that a kind of nullified traffic in the present embodiment reduces, including the transportation network node determined according to planning region in planning region, the weight of the transport need acquisition of information difference mode of transportation by gathering is distributed, according to the internodal mode of transportation of transportation network in described weight distribution planning region.In the present embodiment, after determining planning region and planning time limit, determining the object of planning for the purpose of reducing invalid traffic, the invalid traffic in the present embodiment refers to make trip benefit increase possibly even cause transaction to reduce the unnecessary traffic generating capacity of (such as noise, pollution and energy resource consumption) in traffic trip.According to transport need, railway, highway, aviation, water transport and five kinds of means of transportation of track are considered, make number of transfer minimum based on for the purpose of reducing invalid traffic, walking distance is the shortest, comfortableness and economy are laid equal stress on for optimal objective, make traveller, source of goods seamless connection in these five kinds of means of transportation, reduce the shortcomings such as existing programme transport resource waste, conevying efficiency is low so that it is in the limited time with spatially improve the running efficiency of road network, linkage function and service level.
In the present embodiment, the efficiency parameter under corresponding mode of transportation is obtained according to the mode of transportation between node, set up seamless connection goal constraint function, the best route between being obtained between any two node in planning region by described seamless connection goal constraint function.
Efficiency parameter includes the haulage time under corresponding mode of transportation and infusion of financial resources, and described seamless connection goal constraint function is represented by equation below:
Pj=α Tj+ β Mj,
Wherein: Pj is constraint function, Tj is the haulage time in section between node i and node j, and Mj is the infusion of financial resources in section；
Tj≤Tmax, Tmax are the longest permission in section haulage time between node i and node j,
Mj≤Mmax, Mmax are that between node i and node j, section allows maximum infusion of financial resources；
Minimum Pj value is obtained by relatively each section,
The every kind of means of transportation running time T in section=(Tcj, Ttj, Taj, Tbj) between node i and j, injects capital into as M=(Mcj, Mtj, Maj, Mbj),
S=min (pk), k=1,2 ... n.
Then k scheme is optimal case,
WhereinMij represents the gross investment between i to j, F represents permission infusion of financial resources, number of transfer can be made minimum by seamless connection goal constraint function, walking distance is the shortest, comfortableness and economy are laid equal stress on for optimal objective, make traveller, source of goods seamless connection in these five kinds of means of transportation, reduce transport resource waste, improve conevying efficiency.
In the present embodiment, transport need information is obtained by traffic census, and described traffic census includes that the investigation of Urban Passenger Traffic amount and traffic flow are investigated, and is obtained by described traffic census and traffic attraction occurs, determine node station scale.OD survey (traffic census) includes that the investigation of Urban Passenger Traffic amount and traffic flow are investigated, and passenger flow OD table can be obtained by multiple methods such as home visiting survey, transmitting-receiving table method, questionnaire method, registered vehicle licence plates；Flow of goods OD table is investigated from top to bottom by responsible institution generally according to membership credentials and is obtained.By important contents such as its terminal distribution knowable to passenger flow investigation result, the mode of trip, distance, times；Flow of goods OD survey can get the data such as shipping people, quantities delivered, goods dealing amount, mode of transportation, and OD table is as follows.
In the present embodiment, node includes that starting point, turning point and terminal, described mode of transportation include railway transportation, highway transportation, water-borne transport, air transportation and rail transport.Classified in the node station of each for transportation network mode of transportation by the traffic attraction that occurs obtained by described traffic census, obtain the weight that the classification of each mode of transportation is corresponding, the generation traffic attraction obtained according to OD survey determines node station scale, being classified as follows of every kind of mode of transportation station:
(1) railway station classification:
(1) it is divided into, by operation property, the mixed passenger and freight station 3 kinds that passenger station, goods station and passenger-cargo function have both by operation property railway station.
(2) marshalling yard, district station, intermediate station, overtaking station and passing station 5 kinds can be divided into according to the character of train work according to the character of train work.
(3) portfolio is pressed at station, and geographical conditions divide station by portfolio, and geographical conditions are divided into spy, the station such as, two, three, four, five.Such as, divide by portfolio and daily get on or off the bus and change to passenger more than 60000 people for top grade passenger station, in change one's profession that to wrap in more than 20000 be top grade passenger station.
(2) bus station classification:
The task amount undertaken by station, and it divides in the status of national politics, economic aspect, station can be divided into top grade station, first-class station, secondary station, third station, fourth class station, totally six grades of standing such as five.
Divide by the difference of station technical operation, marshalling yard, district station and intermediate station can be divided into.Marshalling yard and district station are referred to as again technical station.
Divide by Business Nature, passenger station, goods station and mixed passenger and freight station can be divided into.
(3) class of harbours:
It is divided into commercial port, naval port, fishing port, the harbor etc. by purposes；
It is divided into estuary harbour, harbour, river port etc. by present position.
(4) airport classification:
By the character in city, place, airport, status and the effect in the air transportation network of the whole nation, airport is divided into I, II, III, IV class.
I class airport, i.e. whole nation economy, the airport in political and cultural centre city, be whole nation air transportation network and the hinge of international airline.
II class airport, i.e. provincial capital, the autonomous region provincial capital, municipality directly under the Central Government and Important Economic special zone, economically developed densely populated airport has transprovincially, trans-regional course line.
III class airport, refers to the airport of the flourishing or general open city of Economic contrast, and this kind of airport is bigger at the proportion shared by civilian navigation airport.
IV class airport, the airport in addition to above-mentioned three classes is all referred to as IV class airport, and IV class airport is also referred to as feeder route airport.
Mode of transportation feature:
(1) external integrated transportation system
| Railway | Freight volume is big, and seriality is strong, and speed is affected little freight charges by weather relatively low |
| Highway | Speed, the most flexibly, is limited less by natural conditions |
| Water route | Freight volume is big, and freight charges are low, small investment |
| Aviation | Speed is fast, maneuverability |
(2) internal integrated transportation system
| Light rail | Handling capacity of passengers is big, punctual, safety |
| Public transport | Low price, flexibly freedom |
| Level-crossing | Safely, in order |
| Crossings on different level | The traffic capacity is big, time-consuming |
Transportation Network Planning can be divided into starting point S, turning point T=(T1T2 ... Tn) and terminal E.
Such as playing point selection train and be expressed as St, automobile Sc, aircraft Sa, steamer Sb, turning point 1 selects automobile to be expressed as T1c, and turning point 2 selects aircraft T2a, and by that analogy, terminal selects train to be expressed as Et, automobile Ec, aircraft Ea, steamer Eb.
In the present embodiment, respectively these elements are given by expert the weight distribution of oneself, adds up into matrix, the factor in each criterion is compared two-by-two, set up Analytic Hierarchy Process Model according to each element and each element comparative result, obtain weight vectors by described Analytic Hierarchy Process Model.
Determining respective weight with the feature of every kind of means of transportation, the determination of weight has a lot of method, such as Grey Incidence, Fuzzy Analysis Method, analytic hierarchy process (AHP) etc..Below as a example by analytic hierarchy process (AHP).
1. respectively these elements are given the weight distribution of oneself by expert；
2. matrix D is added up intoij；
3. determining weight with analytic hierarchy process (AHP) (AHP), be classified as three layers, ground floor is destination layer: reduce invalid traffic, and the second layer is rule layer: railway, highway, aviation, harbour ... third layer is solution layer,
Comparing the factor in each criterion two-by-two, such as railway is all 1, more a height of 3, a height of 5 mutually with highway comparative advantages, hence it is evident that a height of 7, and the most a height of 9,2,4,6,8 is the situation between 1,3,5,7,9.
The all elements relevant with railway is compared the most therewith, and each element and each element comparative result are in line obtains matrix D=(dij)n × n ,If uiWith ujRatio is dij ,ujWith uiRatio is dji=1/dij
4. Analytic Hierarchy Process Model is set up
5. the arithmetic average of each column vector will be calculated after rectangular array vector normalization with following formula.
Obtain weight vectors w=(w1w2...wn)。
In the present embodiment, person in charge of reception at ceremonies, the expectation of flow of goods can run time and operating cost according to OD survey, above-mentioned weight can determine that mode of transportation between adjacent sites, a specific embodiment is set forth below and is illustrated:
As shown in Figure 2, known O point has n bar to route between D point, each has m node, mode of transportation between node i and j is four kinds of automobile c, train t, aircraft a, steamer b, euclidean distance between node pair determines the design speed of every kind of means of transportation it is known that available every kind of means of transportation is in the operation time of node i Yu j, respectively T=(Tcj, Ttj, Taj, Tbj), infusion of financial resources for M=(Mcj, Mtj, Maj, Mbj), can build constraint function:
Pj=α Tj+ β Mj,
Wherein:
Tj≤Tmax, Tmax are the longest permission in this section haulage time,
Mj≤Mmax, Mmax are that this section allows maximum infusion of financial resources.
Make Pj minimum, then this mode optional between i to j, carry out successively calculating between next node, until D point, the P value of n kind route can be calculated.
Pass through following formula:
S=min (pk), k=1,2 ... n.
Then k scheme is optimal case,
Wherein
Scheme k obtained according to above-mentioned model is final programme.
Finally illustrate is, above example is only in order to illustrate technical scheme and unrestricted, although the present invention being described in detail with reference to preferred embodiment, it will be understood by those within the art that, technical scheme can be modified or equivalent, without deviating from objective and the scope of technical solution of the present invention, it all should be contained in the middle of scope of the presently claimed invention.
Claims (10)
1. the Transportation Network Planning method that a nullified traffic reduces, it is characterised in that: include
The transportation network node in planning region is determined, by the transport need information gathered according to planning region
Obtain the weight distribution of different mode of transportation, according to the transportation network node in described weight distribution planning region
Between mode of transportation.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 1 reduces, it is special
Levy and be: the mode of transportation between also including according to node obtains the efficiency parameter under corresponding mode of transportation, builds
Vertical seamless connection goal constraint function, is obtained in planning region by described seamless connection goal constraint function
Best route between any two node.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 2 reduces, it is special
Levy and be: described efficiency parameter includes the haulage time under corresponding mode of transportation and infusion of financial resources, described seamless
Linking goal constraint function is represented by equation below:
Pj=α Tj+ β Mj,
Wherein: Pj is constraint function, Tj is the haulage time in section between node i and node j, and Mj is
The infusion of financial resources in section；
Tj≤Tmax, Tmax are the longest permission in section haulage time between node i and node j,
Mj≤Mmax, Mmax are that between node i and node j, section allows maximum infusion of financial resources；
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 3 reduces, it is special
Levy and be: by the seamless connection goal constraint function of relatively each route, obtain the multiple of different mode of transportation
Minimum Pj value in route, according to minimum Pj value optimum scheme comparison.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 1 reduces, it is special
Levy and be: described transport need information is obtained by traffic census, and described traffic census includes that passenger flow is handed over
Flux investigation and traffic flow are investigated, and obtained by described traffic census and traffic attraction occurs, determine node
Station scale.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 5 reduces, it is special
Levy and be: described node includes that starting point, turning point and terminal, described mode of transportation include railway transportation, highway
Transport, water-borne transport, air transportation and rail transport.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 6 reduces, it is special
Levy and be: described efficiency parameter also includes the speed of service, freight volume and handling capacity of passengers, determine different mode of transportation
Weight, and set up Analytic Hierarchy Process Model, obtain weight vectors by described Analytic Hierarchy Process Model.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 7 reduces, it is special
Levy and be: obtained by following formula and allow infusion of financial resources,
Wherein, m represents the number of node, MijRepresent node i to the gross investment between node j, F represents
Allow infusion of financial resources.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 6 reduces, it is special
Levy and be: by described Urban Passenger Traffic amount investigation obtain terminal distribution, trip mode, away from discrete time,
Shipping people, shipment amount, goods dealing amount and transportation trade is obtained by the investigation of described traffic flow.
The Transportation Network Planning method that a kind of nullified traffic the most according to claim 6 reduces, its
It is characterised by: the generation traffic attraction obtained according to described traffic census, by each for transportation network mode of transportation
Classifying in node station, obtains the weight that the classification of each mode of transportation is corresponding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610255729.2A CN105956687A (en) | 2016-04-21 | 2016-04-21 | Traffic network planning method capable of decreasing ineffective traffic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610255729.2A CN105956687A (en) | 2016-04-21 | 2016-04-21 | Traffic network planning method capable of decreasing ineffective traffic |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105956687A true CN105956687A (en) | 2016-09-21 |
Family
ID=56915498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610255729.2A Pending CN105956687A (en) | 2016-04-21 | 2016-04-21 | Traffic network planning method capable of decreasing ineffective traffic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105956687A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107967590A (en) * | 2017-12-13 | 2018-04-27 | 浙江理工大学 | A kind of optimization constructing method of Urban Underground Logistics System |
| CN108681788A (en) * | 2018-04-27 | 2018-10-19 | 东南大学 | A kind of city discrete network design problem method based on active safety |
| CN110211406A (en) * | 2019-05-27 | 2019-09-06 | 同济大学 | A kind of public transport pulls in speed guidance control method and system |
| CN113298320A (en) * | 2021-06-22 | 2021-08-24 | 招商局重庆交通科研设计院有限公司 | Method for optimizing low-carbon traffic transportation of urban road |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101692271A (en) * | 2009-09-30 | 2010-04-07 | 青岛海信网络科技股份有限公司 | Comprehensive guidance method of multiple means of transportation |
| CN101908275A (en) * | 2010-07-27 | 2010-12-08 | 南京信息工程大学 | Method for optimizing transit trip based on multi-network |
| CN103226801A (en) * | 2013-03-19 | 2013-07-31 | 天津市市政工程设计研究院 | Airport collecting and distributing traffic volume determination method based on multi-user assignment model |
| CN103473620A (en) * | 2013-09-26 | 2013-12-25 | 青岛海信网络科技股份有限公司 | Prediction method and system for multiple traffic means of comprehensive passenger traffic hub |
| CN104881994A (en) * | 2015-06-18 | 2015-09-02 | 东南大学 | Passenger transport mode node transfer impedance determination method for comprehensive traffic network |
-
2016
- 2016-04-21 CN CN201610255729.2A patent/CN105956687A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101692271A (en) * | 2009-09-30 | 2010-04-07 | 青岛海信网络科技股份有限公司 | Comprehensive guidance method of multiple means of transportation |
| CN101908275A (en) * | 2010-07-27 | 2010-12-08 | 南京信息工程大学 | Method for optimizing transit trip based on multi-network |
| CN103226801A (en) * | 2013-03-19 | 2013-07-31 | 天津市市政工程设计研究院 | Airport collecting and distributing traffic volume determination method based on multi-user assignment model |
| CN103473620A (en) * | 2013-09-26 | 2013-12-25 | 青岛海信网络科技股份有限公司 | Prediction method and system for multiple traffic means of comprehensive passenger traffic hub |
| CN104881994A (en) * | 2015-06-18 | 2015-09-02 | 东南大学 | Passenger transport mode node transfer impedance determination method for comprehensive traffic network |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107967590A (en) * | 2017-12-13 | 2018-04-27 | 浙江理工大学 | A kind of optimization constructing method of Urban Underground Logistics System |
| CN108681788A (en) * | 2018-04-27 | 2018-10-19 | 东南大学 | A kind of city discrete network design problem method based on active safety |
| CN108681788B (en) * | 2018-04-27 | 2021-09-21 | 东南大学 | Urban discrete traffic network design method based on active safety |
| CN110211406A (en) * | 2019-05-27 | 2019-09-06 | 同济大学 | A kind of public transport pulls in speed guidance control method and system |
| CN113298320A (en) * | 2021-06-22 | 2021-08-24 | 招商局重庆交通科研设计院有限公司 | Method for optimizing low-carbon traffic transportation of urban road |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101436345B (en) | System for forecasting harbor district road traffic requirement based on TransCAD macroscopic artificial platform | |
| Kim | Advanced transport and spatial systems models: applications to Korea | |
| CN103226801B (en) | Based on the airport inland transport volume of traffic defining method of multi-user assignment model | |
| CN105956687A (en) | Traffic network planning method capable of decreasing ineffective traffic | |
| Xu et al. | The effects of transportation system improvements on urban performances with heterogeneous residents | |
| Hu et al. | Is mass rapid transit applicable for deep integration of freight-passenger transport? A multi-perspective analysis from urban China | |
| Berdiyorov et al. | A sustainable model of urban public mobility in Uzbekistan | |
| Hu et al. | Reliable design of urban surface-underground integrated logistics system network with stochastic demand and social-environmental concern | |
| Ma et al. | Coupling study on territory space suitability evaluation and construction land expansion simulation: a case study of Jiangxi province, China | |
| Xu et al. | Multi-Mode Coordinated Planning of Urban and Rural Transportation under Heterogeneous Spatial Interaction. | |
| Yang | Spatial planning in Asia | |
| Guo et al. | An urban metro network-based method to evaluate carbon emission and distribution cost of express delivery | |
| Brundige et al. | An economic development strategy for the Trans-Kalahari Corridor | |
| Teng et al. | Container multimodal transport routing selection modeling considering carbon emission cost | |
| Shin | Recent experience of and prospects for high-speed rail in Korea: Implications of a transport system and regional development from a global perspective | |
| Purwasih et al. | Modernization of" transport" as a public transportation for pressing personal vehicle ownership in the city of Tanjung Pinang | |
| Tello-Toapanta | Main long-term policy impacts of the Gotthard base tunnel construction on cross-border land consumption and transformation | |
| Bogart et al. | Railways and growth: evidence from mid-nineteenth century England and Wales | |
| Li et al. | The Optimization of Split Demand Route Planning Under Metro-Truck Collaborative Distribution | |
| CN118333241B (en) | Two-stage optimization method for electric bus network | |
| CN110176140A (en) | A kind of micro- hinge model of intelligence based on multi-internet integration and the algorithm for the model | |
| Wang et al. | Research on the Design and Sustainable Evaluation of Metro-Based Underground Logistics System | |
| Su | Improvements in the Brazilian agricultural products logistic network using a railway design method and a GIS-based optimization model | |
| Malik et al. | Effect of Urban Land Use on Travel Behaviour | |
| Li et al. | Incorporating land use, transport and environmental considerations into time-dependent tolling strategies |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160921 |