zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
A lane-based optimization method for minimizing delay at isolated signal-controlled junctions. (English) Zbl 1087.90504
Summary: This paper presents a lane-based optimization method for minimizing delay at isolated signal-controlled junctions. The method integrates the design of lane markings and signal settings, and considers both traffic and pedestrian movements in a unified framework. While the capacity maximization and cycle length minimization problems are formulated as Binary-Mix-Integer-Linear-Programs (BMILPs) that are solvable by standard branch-and-bound routines, the problem of delay minimization is formulated as a Binary-Mix-Integer-Non-Linear Program (BMINLP). A cutting plane algorithm and a heuristic line search algorithm are proposed to solve this difficult BMINLP problem. The integer variables include the permitted movements on traffic lanes and successor functions to govern the order of signal displays, whereas the continuous variables include the assigned lane flows, common flow multiplier, cycle length, and starts and durations of green for traffic movements, lanes and pedestrian crossings. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The heuristic line search algorithm is more cost-effective in terms of both optimality of solution and computing time requirement.

90B20Traffic problems
90C11Mixed integer programming
65K05Mathematical programming (numerical methods)
Full Text: DOI