Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions (Q444301): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: H. S. Yoon / rank | |||
Normal rank | |||
Property / review text | |||
Summary: This paper presents a 2D convergence density criterion for minimizing the total junction delay at isolated junctions in the lane-based optimization framework. The lane-based method integrates the design of lane markings and signal settings for traffic movements in a unified framework. The problem of delay minimization is formulated as a Binary Mix Integer Non Linear Program (BMINLP). A cutting plane algorithm can be applied to solve this difficult BMINLP problem by adding hyperplanes sequentially until sufficient numbers of planes are created in the form of solution constraints to replicate the original nonlinear surface in the solution space. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. The main difficulty to solve this high-dimension nonlinear nonconvex delay minimization problem using cutting plane algorithm is the requirement of substantial computational efforts to reach a good-quality solution while approximating the nonlinear solution space. A new stopping criterion is proposed by monitoring a 2D convergence density to obtain a converged solution. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The cutting-plane algorithm producing an effective signal design will become more computationally attractive with adopting the proposed stopping criterion. | |||
Property / review text: Summary: This paper presents a 2D convergence density criterion for minimizing the total junction delay at isolated junctions in the lane-based optimization framework. The lane-based method integrates the design of lane markings and signal settings for traffic movements in a unified framework. The problem of delay minimization is formulated as a Binary Mix Integer Non Linear Program (BMINLP). A cutting plane algorithm can be applied to solve this difficult BMINLP problem by adding hyperplanes sequentially until sufficient numbers of planes are created in the form of solution constraints to replicate the original nonlinear surface in the solution space. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. The main difficulty to solve this high-dimension nonlinear nonconvex delay minimization problem using cutting plane algorithm is the requirement of substantial computational efforts to reach a good-quality solution while approximating the nonlinear solution space. A new stopping criterion is proposed by monitoring a 2D convergence density to obtain a converged solution. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The cutting-plane algorithm producing an effective signal design will become more computationally attractive with adopting the proposed stopping criterion. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C09 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C11 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6065448 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonconvex total delay | |||
Property / zbMATH Keywords: nonconvex total delay / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
lane-based optimization method | |||
Property / zbMATH Keywords: lane-based optimization method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Binary Mix Integer Non Linear Program | |||
Property / zbMATH Keywords: Binary Mix Integer Non Linear Program / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58700812 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/858731 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000462228 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical simulations of traffic data via fluid dynamic approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reserve capacity of signal-controlled road network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimization model for area traffic control with link tolls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic model of peak period traffic flows and delays in a corridor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hybrid evolutionary algorithms in a SVR traffic flow forecasting model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Prediction of MPEG video traffic over ATM networks using dynamic bilinear recurrent neural network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic penalty function method for the side constrained traffic assignment problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lane-based optimization method for minimizing delay at isolated signal-controlled junctions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bayesian system identification / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:04, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions |
scientific article |
Statements
Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions (English)
0 references
14 August 2012
0 references
Summary: This paper presents a 2D convergence density criterion for minimizing the total junction delay at isolated junctions in the lane-based optimization framework. The lane-based method integrates the design of lane markings and signal settings for traffic movements in a unified framework. The problem of delay minimization is formulated as a Binary Mix Integer Non Linear Program (BMINLP). A cutting plane algorithm can be applied to solve this difficult BMINLP problem by adding hyperplanes sequentially until sufficient numbers of planes are created in the form of solution constraints to replicate the original nonlinear surface in the solution space. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. The main difficulty to solve this high-dimension nonlinear nonconvex delay minimization problem using cutting plane algorithm is the requirement of substantial computational efforts to reach a good-quality solution while approximating the nonlinear solution space. A new stopping criterion is proposed by monitoring a 2D convergence density to obtain a converged solution. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The cutting-plane algorithm producing an effective signal design will become more computationally attractive with adopting the proposed stopping criterion.
0 references
nonconvex total delay
0 references
lane-based optimization method
0 references
Binary Mix Integer Non Linear Program
0 references
0 references
0 references
0 references