Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
From MaRDI portal
Publication:2371467
DOI10.1016/j.amc.2006.10.017zbMath1137.90398OpenAlexW1981071284MaRDI QIDQ2371467
S. Mehdi Hashemi, Mehdi Ghatee
Publication date: 4 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.10.017
Related Items
An efficient algorithm for computing traffic equilibria using TRANSYT model, Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shortest path problem with forbidden paths
- On finding dissimilar Pareto-optimal paths
- A new polynomial-time algorithm for linear programming
- Fuzzy goal programming: complementary slackness conditions and computational schemes
- Parallel optimization for traffic assignment
- Combined signal setting design and traffic assignment problem.
- Joint optimization for area traffic control and network flow
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- Two-commodity reliability evaluation for a stochastic-flow network with node failure
- A shortest path problem on a network with fuzzy arc lengths
- On finding dissimilar paths
- Heuristics for urban road network design: lane layout and signal settings
- Multicriteria adaptive paths in stochastic, time-varying networks
- Combinatorial algorithms for the minimum interval cost flow problem
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Optimization of Area Traffic Control for Equilibrium Network Flows
- Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The construction and implementation of metamodels
- Multicommodity Distribution System Design by Benders Decomposition
- The factorization approach to large-scale linear programming
- A Survey of Linear Cost Multicommodity Network Flows
- Multicommodity network flows—A survey
- Traffic Equilibrium with Responsive Traffic Control
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Optimal multicommodity network flows with resource allocation
- Optimizing the system of virtual paths by tabu search.
