Optimizing reserve capacity of urban road networks in a discrete network design problem (Q427136): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4094981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming in traffic planning: Models, methods and challenge / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient dual approach to the urban road network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for transportation continuous network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach for optimal design of signalized road network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid meta-heuristic algorithms for solving network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for urban road network design: lane layout and signal settings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming model and solution method for mixed transportation network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A meta-heuristic approach for solving the urban network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reserve Capacity for a Road Network Under Optimized Fixed Time Traffic Signal Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting an Optimum Configuration of One-Way and Two-Way Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using hybrid metaheuristics for the one-way and two-way network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-objective bimodal urban road network design using hybrid metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis for Equilibrium Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiobjective equilibrium network design problem revisited: A simulated annealing approach / rank
 
Normal rank

Revision as of 07:51, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimizing reserve capacity of urban road networks in a discrete network design problem
scientific article

    Statements

    Optimizing reserve capacity of urban road networks in a discrete network design problem (English)
    0 references
    13 June 2012
    0 references
    urban road network design
    0 references
    reserve capacity
    0 references
    one-way streets
    0 references
    Lane addition
    0 references
    bi-level programming
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers