CN112101610B - Multimode network design method for maximizing reachable flows based on reference dependency theory - Google Patents

Multimode network design method for maximizing reachable flows based on reference dependency theory Download PDF

Info

Publication number
CN112101610B
CN112101610B CN202010744117.6A CN202010744117A CN112101610B CN 112101610 B CN112101610 B CN 112101610B CN 202010744117 A CN202010744117 A CN 202010744117A CN 112101610 B CN112101610 B CN 112101610B
Authority
CN
China
Prior art keywords
network
flow
mode
road
representing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010744117.6A
Other languages
Chinese (zh)
Other versions
CN112101610A (en
Inventor
孙会君
于文涛
吴建军
高自友
屈云超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN202010744117.6A priority Critical patent/CN112101610B/en
Publication of CN112101610A publication Critical patent/CN112101610A/en
Application granted granted Critical
Publication of CN112101610B publication Critical patent/CN112101610B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • 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
    • 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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • 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/067—Enterprise or organisation modelling
    • 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

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Tourism & Hospitality (AREA)
  • General Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention provides a multi-mode network design method for maximizing reachable flows based on a reference dependency theory. The method comprises the following steps: each vehicle is used as a mode, a network of each mode is constructed, and a walking network is used as a basic network; formulating a reachability evaluation index of the multi-mode network based on a reference dependency theory, adopting the reachable flow among the nodes as reachability, and combining the networks of all modes according to the reachability evaluation index to obtain the multi-mode network, wherein the multi-mode network comprises an upper planning network and a lower planning network; and solving the upper planning network by adopting an enumeration method, and carrying out network flow distribution on the lower planning network by adopting an incremental distribution method to obtain an optimal design model of the multi-mode network. The method of the embodiment of the invention improves the design level of the network design of the traffic system by maximizing the accessibility of the multi-mode traffic network, has guiding effect on the design of the traffic network and has important significance for constructing the multi-mode traffic system.

Description

Multimode network design method for maximizing reachable flows based on reference dependency theory
Technical Field
The invention relates to the technical field of network reachability, in particular to a multi-mode network design method for maximizing reachable flows based on reference dependency theory.
Background
Reachability is a key indicator in network design. The good accessibility of the traffic network can provide convenient service for users, with the rapid development of economy and society, the public transportation guiding development (Transit Oriented Development, TOD) is generally accepted by society, and meanwhile, the public transportation network is promoted to be more perfect, and meanwhile, along with the rapid rise of subways, the traffic network becomes a main flow traffic mode of public transportation, and the multi-mode transportation trip becomes an integral part of modern life.
Among existing reachability evaluation methods, more commonly used methods include a potential model, an opportunity model, a utility model, a space-time prism model and a stream-based reachability model, and when a flow is taken as a reachability object, the stream-based reachability model is generally adopted.
Traffic tends to develop in multiple modes, but the existing reachability evaluation method based on flow is mostly based on a single mode, meanwhile, people generally have a habit of reaching in advance for a period of time when traveling, the expected reaching time is called a reference point, the reachable effect of the reference point time and the deadline is reduced, and the influence of the reference point is ignored in the existing reachability evaluation method.
There is no effective multi-mode network reachability evaluation method in the prior art.
Disclosure of Invention
The embodiment of the invention provides a multi-mode network design method for maximizing reachable flows based on reference dependency theory, which aims to overcome the problems in the prior art.
In order to achieve the above purpose, the present invention adopts the following technical scheme.
A multi-mode network design method for maximizing reachable flows based on reference dependency theory, comprising:
each vehicle is respectively used as a mode, a network of each mode is constructed, a walking network is used as a basic network, and the impedance of the walking network is represented by the average walking time of a road section;
formulating a reachability evaluation index of the multimode network based on a reference dependency theory, adopting the reachable flow among nodes as reachability, and combining the networks of all modes according to the reachability evaluation index to obtain the multimode network, wherein the multimode network comprises an upper planning network and a lower planning network;
and solving the upper planning network by adopting an enumeration method, and carrying out network flow distribution on the lower planning network by adopting an incremental distribution method to obtain an optimal design model of the multi-mode network.
Preferably, each vehicle is used as a mode, a network of each mode is constructed, a walking network is used as a base network, the walking network impedance is represented by the average walking time of a road section, and the method comprises the following steps:
each vehicle is used as a mode, a network of each mode is constructed, a walking network is constructed as a basic network, and the walking network impedance adopts the average walking time of road sections to represent;
dividing network types into a road node type network and a site type network, wherein the road nodes and the sites are collectively called nodes, and each road is used as a road section of the network when the road node type network is constructed; when a site type network is constructed, two sites are connected under the condition that a line directly reaches between two adjacent sites, the line is used as a road section of the network, the road node type road section is expressed by adopting a BPR function, and the function is thatWherein t is a Representing the transit time of road section a, t o Representing the zero flow impedance of road segment a, C a The traffic capacity of the road section a is represented, lambda and beta represent the blocking coefficient of the road section a, and the station type road section adopts the average travel time of the road section as impedance;
connecting the walking network node with nodes of other networks of various modes through transfer lines to form a walking networkConnecting the nodes serving as travel starting points to obtain travel time threshold value hyper-path link H Connecting nodes serving as travel end points in a walking network to obtain a reference point hyper-path link O ，link H The impedance of (2) is the travel time threshold T H ，link O Is the reference point time T O ，T O ＝T H -T E ，T E Representing expected early arrival time, representing a road segment set of an existing multi-mode network by A, representing a total candidate set to be built by W, representing a road segment set selected from the candidate sets according to a scheme by W', and S H Representing travel time threshold hyper-path set, adopting S O Representing a reference point hyper-path set.
Preferably, the transfer lines include two types, one from the walking network node to the other mode network node, the time is a waiting time, and the waiting time is set to be 5 minutes; another is to set the time to 0 from other mode network nodes to walking network nodes.
Preferably, the establishing the reachability evaluation index of the multimode network based on the reference dependency theory adopts the reachable traffic between the nodes as the reachability, and includes:
formulating a reachability evaluation index of the multi-mode network based on a reference dependency theory, and adopting the reachable flow among the nodes as reachability, wherein the reachability evaluation index is as follows:
AC r,s,H ＝q r,s -q r,s,H (1)
AC r,s,O ＝q r,s -q r,s,O (2)
wherein q is r,s Represents travel demand from starting point r to ending point s, q r,s,H When the travel time threshold hyper-paths are respectively represented to be connected into the multimode network and the reference point hyper-paths are disconnected, the travel time threshold hyper-paths link from the starting point r to the end point s after flow distribution according to the user balance principle r,s,H Flow on, i.e. unreachable flow, AC r,s,H Representing travel time threshold T between two nodes H Lower reachable flow, q r,s,O Respectively representing reference point hyper-paths accessing to the multi-mode network and the travel time threshold hyper-paths being disconnected, distributing the reference point hyper-paths from a starting point r to an end point s according to a user balance principle r,s,O Flow on, i.e. unreachable flow, AC r,s,O Representing reference point time T between two nodes O The achievable flow under, AC represents the system reachability of the multimode network, alpha represents the utility reduction index of the system reachability between the expected arrival time and the cut-off time, and the value is [0,1]。
Preferably, the combining the networks of all modes according to the reachability evaluation index to obtain a multimode network, where the multimode network includes an upper planning network and a lower planning network, includes:
combining networks of all modes according to the reachability evaluation indexes, and establishing a multi-mode network design model of maximized reachable flows based on reference dependency theory, wherein the multi-mode network design model comprises an upper planning network and a lower planning network;
the upper layer planning network aims at maximizing the reachable flow of the multi-mode network, solves the optimal design scheme, and has the following formula:
wherein, c a Representing the construction cost of the candidate road segment a; b represents the total budget of construction costs; y is a Representing a binary decision variable, y a =1 represents a construction candidate segment a, y a =0, indicating no construction;
the lower planning network adopts a user balance principle to carry out flow distribution, and super path link is adopted during flow distribution H And link O The common road section is regarded as the distribution flow to obtain the flow of each road section, the user balance distribution flow is carried out twice according to the different access super paths, and the 1 st access super path link is carried out H Carrying out flow distribution to obtain q r,s,H The 2 nd time of access to the super path link O Carrying out flow distribution to obtain q r,s,O The model is as follows:
lower layer planning 1:
the reaction function is: q (Q) r,s,O ＝Q r,s,O (Y)
Lower layer planning 2:
the reaction function is: q (Q) r,s,H ＝Q r,s,H (Y)
Wherein, (r, s) represents a road section; (r, s, O), (r, s, H) respectively represent a hyper-path link r,s,O ，link r,s,H The method comprises the steps of carrying out a first treatment on the surface of the Y represents a vector of candidate segment selections; q (Q) r,s,O ，Q r,s,H Flow vector x representing next flow distribution a Representing the flow of road segment a; t is t a (ω) represents an impedance function of the road segment; the method comprises the steps of carrying out a first treatment on the surface of theIndicating the flow on the path k between the origin and destination points rs; />Representing a binary variable>Indicating that road segment a is on path k, +.>Indicating no presence.
Preferably, the solving the upper planning network by adopting an enumeration method, and performing network configuration on the lower planning network by adopting an incremental distribution method to obtain an optimal design model of the multi-mode network, includes:
solving the upper layer plan by adopting an enumeration methodWhen the network enumerates, the fees of the road sections prepared for construction are ordered, the accumulated fees are accumulated from low fees to high fees, and when the accumulated fees are more than or equal to the total budget B of the construction fees, the maximum number of the construction road sections is recorded and recorded as N W,up A pre-selection scheme is given by adopting a permutation and combination mode, and the total number of the enumeration schemes isWherein N is W Representing the total number of road segments in the total candidate set W ready for construction, <>Representing the slave N W Selecting the number of all combinations of i road sections;
after the budget of the upper layer planning network meets the inspection condition, carrying out network allocation on the lower layer planning network by adopting an incremental allocation method, wherein the number of each allocation is one percent of the total demand of the origin and destination, the allocation is carried out 100 times, the flow is allocated to the shortest path according to the total existence principle during each allocation, the flow on the super path is obtained, the upper layer objective function is adopted to evaluate the allocation result, the flow on the super path is accumulated, the total flow is subtracted by the accumulated flow to obtain the accessibility of each scheme, and whenAfter all the schemes complete the flow distribution calculation, the scheme with the highest accessibility is selected as the optimal design scheme of the multi-mode network.
According to the technical scheme provided by the embodiment of the invention, the multi-mode network design method based on the reference dependency theory, disclosed by the embodiment of the invention, can be used for overcoming the defects of the traditional flow-based reachability evaluation method, improving the design level of the network design of the traffic system by maximizing the reachability of the multi-mode traffic network, has a certain guiding effect on the design of the traffic network, and has important significance on constructing an efficient multi-mode traffic system.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a process flow diagram of a multi-mode network design method for maximizing reachable flows based on reference dependency theory provided by an embodiment of the invention;
FIG. 2 is a schematic diagram of a basic network route according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a multimode super network according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary only for explaining the present invention and are not to be construed as limiting the present invention.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless expressly stated otherwise, as understood by those skilled in the art. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or coupled. The term "and/or" as used herein includes any and all combinations of one or more of the associated listed items.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
For the purpose of facilitating an understanding of the embodiments of the invention, reference will now be made to the drawings of several specific embodiments illustrated in the drawings and in no way should be taken to limit the embodiments of the invention.
The invention provides a multi-mode network design method for maximizing the reachable flow based on the reference dependency theory, which makes up the defects of the traditional flow-based reachability evaluation method, improves the design level of the network design of the traffic system by maximizing the reachability of the multi-mode traffic network, has a certain guiding effect on the network design, and has important significance on constructing an efficient multi-mode traffic system.
With the development of society, traffic networks tend to develop in multiple modes, and when network design is performed by using a stream-based reachability index, the traditional single-mode network analysis can lead to local optimization rather than system optimization. Furthermore, it is generally desirable for people to be able to arrive 5 minutes or 10 minutes in advance when traveling, i.e. to set a desired arrival time before the cut-off point. Therefore, the invention aims at maximizing the reachable flow of the traffic network and carries out multi-mode network design based on the reference dependency theory.
Example 1
The process flow of the multi-mode network design method for maximizing the reachable flow based on the reference dependency theory provided by the embodiment of the invention is shown in the figure 1, and comprises the following processing steps:
and S10, constructing a multi-mode network.
Each vehicle is referred to as a mode, and a network for each mode is constructed. The walking network is constructed as a base network, and the walking network impedance is represented by the average walking time of the road segments.
Network types are classified into a road node type network and a station type network, and road nodes and stations are collectively referred to as nodes. When the road node type network is constructed, each road is used as a road section of the network; when the site type network is constructed, two sites are connected under the condition that a line directly passes between two adjacent sites, and the line serves as a road section. Road node type road segments are represented by a BPR (Bureau of Public Roads, federal public road agency) function using the travel time of the road segments as impedance, the function beingWherein t is a Representing the transit time of road section a, t o Representing the zero flow impedance of road segment a, C a The traffic capacity of the road segment a is represented, and lambda and beta represent the blocking coefficient of the road segment a. Considering that the bearing capacity of the station type is large, the average travel time of the station type road section is used as impedance, and when a plurality of lines exist between two adjacent stations, the average travel time of all the lines is used as impedance.
The walking network node is connected with the nodes of other networks in various modes through transfer lines. The transfer line comprises two types, one type is from a walking network node to other mode network nodes, the time is waiting time, and the time is set to be 5 minutes; another is to set the time to 0 from other mode network nodes to walking network nodes.
Connecting nodes serving as travel origin and destination points in a walking network, connecting two lines, namely a travel time threshold hyper-path and a reference point hyper-path, and marking the two lines as links H And link O The impedance of the two lines is respectively set as a travel time threshold T H And reference point time T O . The expected advance arrival time is set to 5 minutes or 10 minutes based on the reference dependency theory and the travel habits of people. The relation between the two is as follows: t (T) O ＝T H -T E Wherein T is E Indicating the desired advance arrival time, which takes a value of 5 minutes or 10 minutes. A is used for representing a road segment set of the existing multi-mode network, W is used for representing a total candidate set to be built, W' is used for representing a road segment set selected from the candidate sets according to a scheme, and S is used H Representing travel time threshold hyper-path set, adopting S O Representing a reference point hyper-path set.
And step S20, formulating a multimode network reachability evaluation index. The reachability index based on the reference dependency theory is provided, the reachable flow between the nodes is adopted as the reachability, and the reachability evaluation method comprises the following steps:
AC r,s,H ＝q r,s -q r,s,H (1)
AC r,s,O ＝q r,s -q r,s,O (2)
wherein q is r,s Indicating travel demand from start point r to end point s. q r,s,H When the travel time threshold hyper-paths are respectively represented to be connected into the multi-mode network and the reference point hyper-paths are disconnected, after the distribution according to a user balance principle (a first principle of the Wardrop), the travel time threshold hyper-paths link from the starting point r to the end point s are distributed r,s,H Flow on, i.e. unreachable flow, AC r,s,H Representing travel time threshold T between two nodes H Lower reachable traffic. Similarly, q r,s,O When the reference point hyper-paths are respectively connected into the multi-mode network and the travel time threshold hyper-paths are disconnected, after the flow distribution is carried out according to the user balance principle, the reference point hyper-paths link from the starting point r to the end point s are respectively represented r,s,O Flow on, i.e. unreachable flow, AC r,s,O Representing reference point time T between two nodes O Lower reachable traffic. AC represents multimode network system reachability, α represents the utility reduction index of system reachability between expected arrival time and deadline, and takes the value of [0,1 ]]. Compared with the traditional stream-based reachability model, the reachability evaluation method considers the influence of the reference point and reflects the time concept awareness of people. According to the accessibility ofThe reachability evaluation method calculates reachability values of the multi-mode network.
And step S30, establishing a multi-mode network design model of maximizing reachable flows based on a reference dependency theory, and laying a foundation for multi-mode flow distribution. The model is divided into double-layer planning, the upper layer aims at maximizing the reachable flow of the multi-mode network, and the optimal design scheme is solved, and the formula is as follows:
wherein, c a Representing the construction cost of the candidate road segment a; b represents the total budget of construction costs; y is a Representing a binary decision variable, y a =1 represents a construction candidate segment a, y a =0, indicating no construction.
The lower layer adopts a user balance principle to carry out flow distribution. Super path link during flow distribution H And link O And carrying out flow distribution on the road sections considered as the common road sections so as to obtain the flow of each road section. According to the different access super paths, carrying out twice user balance flow distribution, and accessing the super path link 1 st time H Carrying out flow distribution to obtain q r,s,H The 2 nd time of access to the super path link O Carrying out flow distribution to obtain q r,s,O . The model is as follows:
lower layer planning 1:
lower layer planning 2:
wherein x is a Representing the flow of road segment a; t is t a (ω) represents an impedance function of the road segment;indicating the flow on the path k between the origin and destination points rs; />Representing a binary variable>Indicating that road segment a is on path k, +.>Indicating no presence.
The traffic q on the super path r,s,H And q r,s,O The method is represented by a in common with a common road section, but the method lacks of continuity in letters between upper and lower layers from the aspect of a formula, and the reaction function is not easy to represent. Therefore, in order to more clearly express the association between the upper layer and the lower layer, the model is deformed, the set of road segments is divided, and different letters are used for expression, but the cores are the same, and no essential difference exists. Because the hyper-path is a line formed by directly connecting the origin and destination points r, s, the hyper-path is a road section and is also a path. The underlying planning model is then deformed into:
lower layer planning 1:
the reaction function is: q (Q) r,s,O ＝Q r,s,O (Y)
Lower layer planning 2:
the reaction function is: q (Q) r,s,H ＝Q r,s,H (Y)
Wherein, (r, s) represents a road section; (r, s, O), (r, s, H) respectively represent a hyper-path link r,s,O ，link r,s,H The method comprises the steps of carrying out a first treatment on the surface of the Y represents a vector of candidate segment selections; q (Q) r,s,O ，Q r,s,H Representing the flow vector for the next flow.
And S40, solving the model, and calculating an optimal network design scheme.
The invention adopts an enumeration method to give a preselection scheme in the upper layer planning, when enumeration, firstly, the fees of road sections to be built are ordered, the accumulated fees are accumulated from low fees to high fees, when the accumulated fees are more than or equal to the total budget B of the construction fees, the maximum number of the construction road sections is recorded and recorded as N W,up A pre-selection scheme is given by adopting a permutation and combination mode, and the total number of the enumeration schemes isWherein N is W Representing the total number of road segments in the total candidate set W ready for construction, <>Representing the slave N W The number of all combinations of i road segments is selected. Checking budget of a method aiming at a preselection scheme of an upper layer, after meeting budget conditions, carrying out network allocation by adopting an incremental allocation method, wherein the number of each allocation is one percent of the total demand of an origin and destination, the allocation is carried out 100 times, when each allocation is carried out, the flow is allocated to a shortest path according to the total existence principle to obtain the flow on a super path, an upper layer objective function is adopted to evaluate the allocation result, the flow on the super path is accumulated, the total flow is subtracted by the accumulated flow to obtain the accessibility of each scheme, and when the flow is insufficient, the flow on the super path is estimated>After all the schemes complete the flow distribution calculation, the scheme with the highest accessibility is selected as the optimal design scheme of the multi-mode network.
Example two
1 construction of multimode networks
(1) Taking a multimode network including an automobile and a bus as an example for illustration, fig. 2 is a schematic diagram of a basic network route provided in an embodiment of the present invention, as shown in fig. 2. In the figure, the number of the alternative road sections is 4, 13,14,15 and 16, and the walking network and the public transport network are synchronously constructed, for example, the road section 13 is constructed, which shows that the walking network and the public transport network are both constructed 13. The number of the bus stations is 5, the number of the lines is four, the line 1 comprises 1-1 and 1-2, the line 2 comprises 2-1 and 2-2, the line 3 comprises 3-1 and 3-2, the line 4 comprises 4-1 and 4-2, and the walking network, the automobile network and the bus network parameters are shown in tables 1, 2 and 3. Traffic demand is expressed in terms of flow in people/min, and when using a car, as shown in table 4, the traffic capacity in the traffic capacity table 1 is assumed to be equivalent to people/min by one person. The candidate segment set construction costs are shown in table 5, with the total budget set to 9 million yuan. The travel time threshold is 60 minutes and the reference point time is set to 50 minutes, i.e. 10 minutes in advance is expected to reach the destination.
Table 1 walking network parameters
Table 2 automotive network parameters
Table 3 bus network parameters
TABLE 4 traffic demand
TABLE 5 construction costs
(2) The multimode network is reconstructed according to the method of the invention, and the constructed multimode super network is shown in fig. 3:
step 1, constructing a walking network as a basic network, wherein the walking network impedance is represented by the average walking time of a road section.
And 2, constructing an automobile network and a public transportation network. Network types are classified into a road node type network and a station type network, and road nodes and stations are collectively referred to as nodes. When the road type network is constructed, each road is used as a road section of the network; when the site type network is constructed, two sites are connected under the condition that a line directly passes between two adjacent sites, and the line serves as a road section. Taking the travel time of the road section as impedance, the road node type road section is expressed by adopting a BPR function, and the function is thatWherein t is a Representing the transit time of road section a, t o Representing the zero flow impedance of road segment a, C a The traffic capacity of the road section a is represented, and lambda and beta represent the blocking coefficients of the road section a, and the values are respectively 0.15 and 4. Considering that the bearing capacity of the station type is large, the average travel time of the station type road section is used as impedance, and when a plurality of lines exist between two adjacent stations, the average travel time of all the lines is used as impedance, as shown in table 6.
TABLE 6 bus route time after re-composition
The time on the bus network segment 3 in fig. 3 is the average of travel times of the bus network segments 1-2,2-2,3-2 in fig. 2.
And 3, connecting the walking network node with the nodes of other networks in all modes through a transfer line. The transfer line comprises two types, one type is from a walking network node to other mode network nodes, the time is waiting time, and the time is set to be 5 minutes; another is to set the time to 0 from other mode network nodes to walking network nodes.
Step 4, connecting the nodes serving as travel origin and destination points in the walking network, connecting two lines, namely a travel time threshold hyper-path and a reference point hyper-path, respectively, and marking the hyper-paths as links H And link O The impedance of the two lines is respectively set as a travel time threshold T H =60 minutes and reference point time T O =50 min. A is used for representing a road segment set of the existing multi-mode network, W is used for representing a total candidate set to be built, W' is used for representing a road segment set selected from the candidate sets according to a scheme, and S is used H Representing travel time threshold hyper-path set, adopting S O Representing a reference point hyper-path set.
Finally, a multi-mode network structure diagram and a table for programming are formed, as shown in fig. 3, table 7 and table 8, wherein the node numbers of the two tables are represented by combining modes and nodes, for example, a walking network node 1 is represented by W1, W represents a walking network, and so on, C represents an automobile network, and B represents a public transportation network.
TABLE 7 basic parameter Table for average travel time section
/>
/>
Table 8 basic parameter table of road section using BPR function
2, designing a multimode network reachability evaluation index.
And (5) formulating a multimode network reachability evaluation index. Providing a reachability index based on a reference dependency theory, adopting the reachable flow between nodes as reachability, setting a utility reduction index alpha of system reachability between expected arrival time and deadline to be 0.5, and enabling a reachability evaluation index to be as follows:
wherein q is r,s Indicating travel demand from start point r to end point s. q r,s,H When the travel time threshold hyper-paths are respectively represented to be connected into the multi-mode network and the reference point hyper-paths are disconnected, after the distribution according to a user balance principle (a first principle of the Wardrop), the travel time threshold hyper-paths link from the starting point r to the end point s are distributed r,s,H Flow on, i.e. unreachable flow, AC r,s,H Representing travel time threshold T between two nodes H Lower reachable traffic. Similarly, q r,s,O When the reference point hyper-paths are respectively connected into the multi-mode network and the travel time threshold hyper-paths are disconnected, after the flow distribution is carried out according to the user balance principle, the reference point hyper-paths link from the starting point r to the end point s are respectively represented r,s,O Flow on, i.e. unreachable flow, AC r,s,O Representing reference point time T between two nodes O Lower reachable traffic. AC represents the reachability of the multi-mode network system, and the reachability value of the multi-mode network is calculated according to the reachability evaluation method.
And 3, establishing a multi-mode network design model for maximizing reachable flows based on a reference dependency theory, and laying a foundation for multi-mode flow distribution. The model is divided into double-layer planning, the upper layer aims at maximizing the reachable flow of the multi-mode network, and the optimal design scheme is solved, and the formula is as follows:
wherein, c a Representing the construction cost of the candidate road segment a; b represents the total budget of construction costs; y is a Representing a binary decision variable, y a =1 represents a construction candidate segment a, y a =0, indicating no construction.
The lower layer adopts a user balance principle to carry out flow distribution. Super path link during flow distribution H And link O And carrying out flow distribution on the road sections considered as the common road sections so as to obtain the flow of each road section. According to the different access super paths, carrying out twice user balance flow distribution, and accessing the super path link 1 st time H Carrying out flow distribution to obtain q r,s,H The 2 nd time of access to the super path link O Carrying out flow distribution to obtain q r,s,O . The model is as follows:
lower layer planning 1:
the reaction function is: q (Q) r,s,O ＝Q r,s,O (Y)
Lower layer planning 2:
the reaction function is: q (Q) r,s,H ＝Q r,s,H (Y)
Wherein x is a Representing the flow of road segment a; t is t a (ω) represents an impedance function of the road segment; the method comprises the steps of carrying out a first treatment on the surface of theIndicating the traffic on the path k between the origin and destination points; />Representing a binary variable>Indicating that road segment a is on path k，/>Indicating no; (r, s) represents a road section; (r, s, O), (r, s, H) respectively represent a hyper-path link r,s,O ，link r,s,H The method comprises the steps of carrying out a first treatment on the surface of the Y represents a vector of candidate segment selections; q (Q) r,s,O ，Q r,s,H Representing the flow vector for the next flow.
And 4, solving the model and calculating an optimal network design scheme.
(1) Adopting enumeration method in upper layer planning to give pre-selection scheme
Firstly, sorting the cost of road sections to be built, accumulating the cost from low cost to high cost, and recording the maximum number of the road sections to be built when the accumulated cost is greater than or equal to the total budget B=9 million yuan of the building cost, thereby knowing the maximum number of the road sections to be built N W,up =2, giving a pre-selected scheme by permutation and combination, the total number of enumeration schemes beingWherein N is W =4 represents the total number of road segments in the total candidate set W ready for construction, +.>Representing the slave N W The number of all combinations of i road segments is selected.
(2) Aiming at the preselection scheme of the upper layer, the lower layer planning adopts an incremental allocation method to carry out network allocation, the number of each allocation is one percent of the total demand of the origin and destination, the allocation is carried out 100 times, and the flow is allocated to the shortest path when each allocation is carried out, so that the flow on the super path is obtained.
(3) The flow distribution results of the 10 schemes are evaluated by using the upper layer objective function, and the results are shown in table 6, and it is known that the optimal multi-mode network design scheme is scheme 4, the road segment aggregate {16}, while the scheme 7 and the scheme 9 can achieve the same effect, the construction cost is higher, and the optimal network design scheme is scheme 4 under the existing traffic demand condition.
Table 9 protocol reachability evaluation results
In summary, the embodiment of the invention considers the influence of the reference point, and provides a method for designing a multi-mode network with the aim of maximizing the reachable flows. The invention provides a network construction based on lines, combining collinear site type road sections into one, connecting all modes through a transfer line, and simultaneously designing a travel time threshold super-path and a reference point super-path to express the influence of reference points so as to form a multi-mode super-network. Secondly, based on the reachability of the reference dependency theory, a multi-mode network reachability evaluation index is designed, and meanwhile, a method for solving a multi-mode network design model is provided, and finally, an optimal network design scheme is obtained. The method is simple and easy to operate, is suitable for the problem of multi-mode network design, can provide effective information for urban road network design and bus route optimization, assists a traffic management department in reasonably carrying out route adjustment, finally improves the accessibility level of a traffic system, ensures that more people can reach a destination, and further improves the traffic service level.
The multi-mode network design method based on the reference dependency theory, disclosed by the embodiment of the invention, overcomes the defects of the traditional stream-based reachability evaluation method, improves the design level of the network design of the traffic system by maximizing the reachability of the multi-mode traffic network, has a certain guiding effect on the design of the traffic network, and has important significance in constructing an efficient multi-mode traffic system.
Those of ordinary skill in the art will appreciate that: the drawing is a schematic diagram of one embodiment and the modules or flows in the drawing are not necessarily required to practice the invention.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for apparatus or system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, with reference to the description of method embodiments in part. The apparatus and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
The present invention is not limited to the above-mentioned embodiments, and any changes or substitutions that can be easily understood by those skilled in the art within the technical scope of the present invention are intended to be included in the scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims (4)

1. A reference dependency theory-based multi-mode network design method for maximizing reachable flows, comprising:
each vehicle is respectively used as a mode, a network of each mode is constructed, a walking network is used as a basic network, and the impedance of the walking network is represented by the average walking time of a road section;
formulating a reachability evaluation index of the multi-mode network based on a reference dependency theory;
adopting the reachable flow among the nodes as reachability, and combining the networks of all modes according to the reachability evaluation index to obtain a multi-mode network, wherein the multi-mode network comprises an upper planning network and a lower planning network;
solving the upper planning network by adopting an enumeration method, and carrying out network flow distribution on the lower planning network by adopting an incremental distribution method to obtain an optimal design model of the multi-mode network;
the making of the reachability evaluation index of the multimode network based on the reference dependency theory adopts the reachable flow between the nodes as the reachability, and comprises the following steps:
formulating a reachability evaluation index of the multi-mode network based on a reference dependency theory, and adopting the reachable flow among the nodes as reachability, wherein the reachability evaluation index is as follows:
AC r,s,H ＝q r,s -q r,s,H (1)
AC r,s,O ＝q r,s -q r,s,O (2)
wherein q is r,s Represents travel demand from starting point r to ending point s, q r,s,H When the travel time threshold hyper-paths are respectively represented to be connected into the multimode network and the reference point hyper-paths are disconnected, the travel time threshold hyper-paths link from the starting point r to the end point s after flow distribution according to the user balance principle r,s,H Flow on, i.e. unreachable flow, AC r,s,H Representing travel time threshold T between two nodes H Lower reachable flow, q r,s,O Respectively representing reference point hyper-paths accessing to the multi-mode network and the travel time threshold hyper-paths being disconnected, distributing the reference point hyper-paths from a starting point r to an end point s according to a user balance principle r,s,O Flow on, i.e. unreachable flow, AC r,s,O Representing reference point time T between two nodes O The achievable flow under, AC represents the system reachability of the multimode network, alpha represents the utility reduction index of the system reachability between the expected arrival time and the cut-off time, and the value is [0,1]；
And combining the networks of all modes according to the reachability evaluation index to obtain a multi-mode network, wherein the multi-mode network comprises an upper planning network and a lower planning network, and the method comprises the following steps:
combining networks of all modes according to the reachability evaluation indexes, and establishing a multi-mode network design model of maximized reachable flows based on reference dependency theory, wherein the multi-mode network design model comprises an upper planning network and a lower planning network;
the upper layer planning network aims at maximizing the reachable flow of the multi-mode network, solves the optimal design scheme, and has the following formula:
wherein, c a Representing the construction cost of the candidate road segment a; b represents the total budget of construction costs; y is a Representing a binary decision variable, y a =1 represents a construction candidate segment a, y a =0, indicating no construction; w (w)
The lower planning network adopts a user balance principle to carry out flow distribution, and super path link is adopted during flow distribution H And link O The common road section is regarded as the distribution flow to obtain the flow of each road section, the user balance distribution flow is carried out twice according to the different access super paths, and the 1 st access super path link is carried out H Carrying out flow distribution to obtain q r,s,H The 2 nd time of access to the super path link O Carrying out flow distribution to obtain q r,s,O The model is as follows:
lower layer planning 1:
the reaction function is: q (Q) r,s,O ＝Q r,s,O (Y)
Lower layer planning 2:
the reaction function is: q (Q) r,s,H ＝Q r,s,H (Y)
Wherein, (r, s) represents a road section; (r, s, O), (r, s, H) respectively represent a hyper-path link r,s,O ，link r,s,H The method comprises the steps of carrying out a first treatment on the surface of the Y represents a vector of candidate segment selections; q (Q) r,s,O ，Q r,s,H Flow vector x representing next flow distribution a Representing the flow of road segment a; t is t a (ω) represents an impedance function of the road segment;indicating the flow on the path k between the origin and destination points rs; />Representing a binary variable>Indicating that road segment a is on path k, +.>Representing the absence, using A to represent the road segment set of the existing multimode network, W to represent the total candidate set to be built, W' to represent the road segment set selected from the candidate set according to the scheme, using S H Representing travel time threshold hyper-path set, adopting S O Representing a reference point hyper-path set.
2. The method of claim 1, wherein each vehicle is used as a mode, the network of each mode is constructed, the walking network is used as a base network, the walking network impedance is represented by the average walking time of the road section, and the method comprises the following steps:
each vehicle is used as a mode, a network of each mode is constructed, a walking network is constructed as a basic network, and the walking network impedance adopts the average walking time of road sections to represent;
dividing network types into a road node type network and a site type network, wherein the road nodes and the sites are collectively called nodes, and each road is used as a road section of the network when the road node type network is constructed; when a site type network is constructed, two sites are connected under the condition that a line directly reaches between two adjacent sites, the line is used as a road section of the network, the road node type road section is expressed by adopting a BPR function, and the function is thatWherein t is a Representing the transit time of road section a, t o Representing the zero flow impedance of road segment a, C a The traffic capacity of the road section a is represented, lambda and beta represent the blocking coefficient of the road section a, and the station type road section adopts the average travel time of the road section as impedance;
connecting the walking network nodes with nodes of other networks in all modes through transfer lines, and connecting the nodes serving as travel starting points in the walking network to obtain travel time threshold value super-path link H Connecting nodes serving as travel end points in a walking network to obtain a reference point hyper-path link O ，link H The impedance of (2) is the travel time threshold T H ，link O Is the reference point time T O ，T O ＝T H -T E ，T E Indicating the desired advance arrival time.
3. The method according to claim 2, characterized in that the transfer line comprises two kinds, one from the walking network node to the other mode network node, the time being a waiting time, set to 5 minutes; another is to set the time to 0 from other mode network nodes to walking network nodes.
4. The method of claim 1, wherein said solving the upper-layer planning network by using an enumeration method, and performing network streaming on the lower-layer planning network by using an incremental allocation method, to obtain an optimal design model of the multi-mode network, comprises:
solving the upper planning network by adopting an enumeration method, sequencing the cost of the road sections prepared for construction during enumeration, accumulating from low cost to high cost, and recording the maximum number of the road sections to be constructed when the accumulated cost is greater than or equal to the total budget B of the construction cost and recording as N W,up A pre-selection scheme is given by adopting a permutation and combination mode, and the total number of the enumeration schemes isWherein N is W Representing the total number of road segments in the total candidate set W ready for construction, <>Representing the slave N W Selecting the number of all combinations of i road sections;
after the budget of the upper layer planning network meets the inspection condition, carrying out network allocation on the lower layer planning network by adopting an incremental allocation method, wherein the number of each allocation is one percent of the total demand of the origin and destination, the allocation is carried out 100 times, the flow is allocated to the shortest path according to the total existence principle during each allocation, the flow on the super path is obtained, the upper layer objective function is adopted to evaluate the allocation result, the flow on the super path is accumulated, the total flow is subtracted by the accumulated flow to obtain the accessibility of each scheme, and whenAfter all the schemes complete the flow distribution calculation, the scheme with the highest accessibility is selected as the optimal design scheme of the multi-mode network.
CN202010744117.6A 2020-07-29 2020-07-29 Multimode network design method for maximizing reachable flows based on reference dependency theory Active CN112101610B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010744117.6A CN112101610B (en) 2020-07-29 2020-07-29 Multimode network design method for maximizing reachable flows based on reference dependency theory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010744117.6A CN112101610B (en) 2020-07-29 2020-07-29 Multimode network design method for maximizing reachable flows based on reference dependency theory

Publications (2)

Publication Number Publication Date
CN112101610A CN112101610A (en) 2020-12-18
CN112101610B true CN112101610B (en) 2023-10-17

Family

ID=73749820

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010744117.6A Active CN112101610B (en) 2020-07-29 2020-07-29 Multimode network design method for maximizing reachable flows based on reference dependency theory

Country Status (1)

Country Link
CN (1) CN112101610B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114999668B (en) * 2022-04-13 2024-06-07 浙江大学 Public transportation system epidemic situation transmission blocking method based on integer programming

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004156982A (en) * 2002-11-06 2004-06-03 Equos Research Co Ltd Traffic information providing system and traffic information providing program
CN105787586A (en) * 2016-02-23 2016-07-20 中山大学 Bus line station optimal arrangement method maximizing space-time reachability
CN107103142A (en) * 2017-07-11 2017-08-29 交通运输部公路科学研究所 Comprehensive traffic network operation situation towards highway and the railway network deduces emulation technology
CN107274032A (en) * 2017-06-29 2017-10-20 上海交通大学 A kind of Bi-objective Transportation Network Planning model optimization computational methods

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004156982A (en) * 2002-11-06 2004-06-03 Equos Research Co Ltd Traffic information providing system and traffic information providing program
CN105787586A (en) * 2016-02-23 2016-07-20 中山大学 Bus line station optimal arrangement method maximizing space-time reachability
CN107274032A (en) * 2017-06-29 2017-10-20 上海交通大学 A kind of Bi-objective Transportation Network Planning model optimization computational methods
CN107103142A (en) * 2017-07-11 2017-08-29 交通运输部公路科学研究所 Comprehensive traffic network operation situation towards highway and the railway network deduces emulation technology

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
基于GIS的农村医疗设施空间可达性分析;吴建军 等;《人文地理》(第第5期期);全文 *
老城区公交站点布局评估与优化方法;赵静瑶;高磊;陈玮;;交通与运输(04);全文 *
轨道交通站点步行可达性与便利性评估方法研究;王维礼;于浩;;天津建设科技(06);全文 *
随机均衡配流下的连续性交通网络设计;田晟;马美娜;许凯;;华南理工大学学报(自然科学版)(11);全文 *

Also Published As

Publication number Publication date
CN112101610A (en) 2020-12-18

Similar Documents

Publication Publication Date Title
CN112466122B (en) Method and device for generating alternative line set and planning line of public traffic line network
CN104217129B (en) A kind of urban rail road network passenger flow evaluation method
CN109543934B (en) Method for evaluating comprehensive index of urban public transport network
CN110598942B (en) Method for synchronously optimizing community public transportation network and departure frequency of connection subways in consideration of full coverage of area
CN104217579B (en) Transportation network key road segment searching method based on section sub-network redundancy
CN101650705A (en) Method and device for constructing bus transfer network
CN107092986B (en) Bus passenger travel path selection method based on stations and collinear operation
CN105678410A (en) Public traffic system space-time reachability modeling method of considering network connectivity time varying characteristics
CN106203725A (en) Door-to-door trip route scheme personalized recommendation method based on heuristic search
CN104217086A (en) Urban public transport network optimization method
CN102169512A (en) Urban mass transit network dynamic accessibility computing method based on time window constraints
CN104200650A (en) Multimode public transportation transferring method in urban congestion period
CN110674974A (en) Effective path set generation method for urban rail transit passenger travel
CN108960539A (en) A kind of demand response formula feeder bus sytem method for optimizing route
CN103530694A (en) Urban subway dynamic passenger flow distribution method constructed on the basis of time-space network
CN101763612A (en) Freight allocating method for track transportation system
CN112101610B (en) Multimode network design method for maximizing reachable flows based on reference dependency theory
CN103473606B (en) The public traffic network entirety transfer performance optimization method of the maximum shortest path length based on GIS
CN109816979A (en) Consider bus arrival frequency and by bus the public bus network recommended method of comfort level
CN109840624A (en) A kind of electric car charging schedule optimization method based on Dijkstra algorithm
CN102567389A (en) Combined traffic network forming method and equipment as well as path searching method and equipment
CN110378557B (en) Peak-shifting travel policy evaluation method based on reverse traffic distribution
CN108493908B (en) A kind of locality protection partition method considering communication constraint
CN107679653B (en) OD distribution method based on dominant travel distance
CN108627163A (en) Weights listing maintenance, device and navigation route planning method, apparatus

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