Turning restriction design in traffic networks with a budget constraint

DOI10.1007/s10898-013-0127-1zbMath1312.90014OpenAlexW2113112208MaRDI QIDQ486412

Daniel C. S. Duarte, Humberto J. Longo, Bryon R. Hall, Les R. Foulds, Hugo A. D. Do Nascimento

Publication date: 15 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0127-1

zbMATH Keywords

multi-startsuccessive linear approximationturning restriction designurban network design problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (1)

A puzzled driver is a better driver: enforcing speed limits using a randomization strategy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models
• An algorithm for local continuous optimization of traffic signals
• Hybrid meta-heuristic algorithms for solving network design problem
• A turning restriction design problem in urban road networks
• A meta-heuristic approach for solving the urban network design problem
• Graph theory applications
• Combined signal setting design and traffic assignment problem.
• Bilevel programming in traffic planning: Models, methods and challenge
• A review of urban transportation network design problems
• A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks
• A multi-start local search heuristic for ship scheduling -- a computational study
• Heuristics for urban road network design: lane layout and signal settings
• Minimization of functions having Lipschitz continuous first partial derivatives
• Flows in transportation networks
• Principles of scatter search
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Nonlinear Optimization by Successive Linear Programming
• Using hybrid metaheuristics for the one-way and two-way network design problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: Turning restriction design in traffic networks with a budget constraint