Unlock instant, AI-driven research and patent intelligence for your innovation.

A method and device for solving an infinite-dimensional traffic assignment problem

A traffic allocation and problem-solving technology, which is applied in traffic flow detection, traffic control system, traffic control system of road vehicles, etc., can solve the problems of low convergence accuracy, slow decline, stop, etc., and achieve the effect of ensuring uniqueness and high precision

Active Publication Date: 2021-09-28
SOUTHWEST JIAOTONG UNIV +1
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the path-based algorithm needs to store a large number of paths. Due to the limitation of computer hardware conditions in the 1980s and 1990s, the path-based algorithm has not been favored.
At the same time, due to the complexity of the infinite-dimensional dual-criteria problem, the development of the infinite-dimensional dual-criteria traffic allocation algorithm only stays at the link-based level
At present, the algorithm that can solve the infinite-dimensional road network problem is mainly improved based on the Frank-Wolfe (F-W) algorithm. This type of algorithm converges quickly in the early stage of the solution, but in the later stage, the iteration direction is almost perpendicular to the direction of the steepest descent, and the decline is slow, and the convergence accuracy is low.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method and device for solving an infinite-dimensional traffic assignment problem
  • A method and device for solving an infinite-dimensional traffic assignment problem
  • A method and device for solving an infinite-dimensional traffic assignment problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0079] Such as figure 1 As shown, this embodiment provides a method for solving the infinite-dimensional traffic allocation problem, and the method includes step S1, step S2, step S3, step S4 and step S5.

[0080] Step S1. Obtain the basic parameters of the road network, the maximum number of steps in the main loop and the maximum number of steps in the inner loop, and obtain the flow of each road section, the flow of each path, and the set of paths formed by each O-D pair in the road network based on the basic parameters of the road network;

[0081] Step S2, execute the main loop, add a new effective path to the path set for each O-D pair in the road network, perform boundary adjustment or flow adjustment for each O-D pair, and obtain the first result;

[0082] Step S3, execute the inner loop, perform boundary adjustment or flow adjustment on the O-D pairs whose convergence index is lower than the road network convergence index multiple times, delete unused paths, and obtain...

Embodiment 2

[0178] Such as figure 2 As shown, the present embodiment provides a device for solving the infinite-dimensional traffic allocation problem, the device includes an acquisition module 701, a main loop module 702, an inner loop module 703, a calculation module 704 and an output module 705, and the acquisition module 701 , used to obtain the basic parameters of the road network, the maximum number of steps in the main loop and the maximum number of steps in the inner loop, based on the basic parameters of the road network to obtain the flow of each road section, the flow of each path, and the set of paths formed by each O-D pair in the road network; The main loop module 702 is used to execute the main loop, add a new effective path to the path set for each O-D pair in the road network, perform boundary adjustment or flow adjustment for each O-D pair, and obtain the first result; the inner loop module 703, Used to execute the inner loop, perform boundary adjustment or flow adjustm...

Embodiment 3

[0185] Corresponding to the above method embodiment, the embodiment of the present disclosure also provides a device for solving the infinite-dimensional traffic allocation problem. The device for solving the infinite-dimensional traffic allocation problem described below is the same as the one for solving the infinite-dimensional traffic problem described above. Methods of assigning questions can be cross-referenced.

[0186] image 3 It is a block diagram of a device 800 for solving an infinite-dimensional traffic allocation problem according to an exemplary embodiment. Such as image 3 As shown, the electronic device 800 may include: a processor 801 and a memory 802 . The electronic device 800 may also include one or more of a multimedia component 803 , an input / output (I / O) interface 804 , and a communication component 805 .

[0187] Wherein, the processor 801 is used to control the overall operation of the electronic device 800, so as to complete all or part of the steps...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention provides a method and device for solving the problem of infinite-dimensional traffic allocation. The method includes: obtaining basic parameters of the road network, the maximum number of steps in the main cycle and the maximum number of steps in the inner cycle, and obtaining the road network based on the basic parameters of the road network Each O-D in each link flow, each path flow and path collection that form; Execute the main loop, obtain the first result; Execute the inner loop, obtain the second result; Based on the first result and the second result, Calculate the road network convergence index; execute the main loop and the inner loop repeatedly until convergence, or reach the maximum number of loop steps, the maximum number of loop steps is the maximum loop steps of the inner loop or the maximum loop steps of the main loop, and the output finally reaches equilibrium The path set of the state, the path flow and the flow of each road segment. Based on the method in the present invention, the infinite-dimensional dual-criteria flow distribution problem can be converged faster to higher precision, and the path flow balance solution that cannot be obtained based on the road section algorithm can be obtained.

Description

technical field [0001] The invention relates to the technical field of traffic distribution, in particular to a method and device for solving the problem of infinite-dimensional traffic distribution. Background technique [0002] The infinite-dimensional dual-criteria traffic allocation problem can be regarded as an extension of the standard traffic allocation problem. Compared with the standard traffic allocation problem, each user will consider his own time value when choosing a route and choose the generalized cost minimum by combining the two criteria of time and money. Each user cannot reduce his generalized travel cost by changing the selected route when the infinite-dimensional dual-criteria equilibrium is reached. In the infinite-dimensional double-criteria problem, a continuous distribution is used to describe the time value of each user, so it is called "infinite-dimensional". [0003] According to the decomposition of road network topology, the standard traffic a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G08G1/01G08G1/0968G06Q10/06
Inventor 谢军王倩妮聂宇唐优华刘晓波冯时
Owner SOUTHWEST JIAOTONG UNIV