zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Convergence study of minimizing the nonconvex total delay using the lane-based optimization method for signal-controlled junctions. (English) Zbl 1244.65090
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.
MSC:
65K05Mathematical programming (numerical methods)
90C26Nonconvex programming, global optimization
90C09Boolean programming
90C11Mixed integer programming