Turning restriction design in traffic networks with a budget constraint

DOI10.1007/S10898-013-0127-1MaRDI QIDQ486412zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• A turning restriction design problem in urban road networks
• A bi-objective turning restriction design problem in urban road networks
• scientific article; zbMATH DE number 3918063
• scientific article; zbMATH DE number 3891064
• Modeling for shortest path of road network with restriction

Cites work

• A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A meta-heuristic approach for solving the urban network design problem
• A multi-start local search heuristic for ship scheduling -- a computational study
• A review of urban transportation network design problems
• A suggested computation for maximal multi-commodity network flows
• A turning restriction design problem in urban road networks
• An algorithm for local continuous optimization of traffic signals
• Bilevel programming in traffic planning: Models, methods and challenge
• Combined signal setting design and traffic assignment problem.
• Decomposition Principle for Linear Programs
• Flows in transportation networks
• Graph theory applications
• Heuristics for urban road network design: lane layout and signal settings
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3515612 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Hybrid meta-heuristic algorithms for solving network design problem
• Minimization of functions having Lipschitz continuous first partial derivatives
• Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models
• Nonlinear Optimization by Successive Linear Programming
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• Principles of scatter search
• Selecting a good configuration of one-way and two-way routes using tabu search
• Using hybrid metaheuristics for the one-way and two-way network design problem

Cited in

(4)

• Route planning with turn restrictions: A computational experiment
• A puzzled driver is a better driver: enforcing speed limits using a randomization strategy
• A bi-objective turning restriction design problem in urban road networks
• A turning restriction design problem in urban road networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486412)