An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem
From MaRDI portal
Publication:439404
DOI10.1016/J.EJOR.2011.09.035zbMath1244.90058OpenAlexW1994483530MaRDI QIDQ439404
Bruno Montella, Luca D'Acierno, Mariano Gallo
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.035
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (6)
Failure of classical traffic flow theories: stochastic highway capacity and automatic driving ⋮ Criticism of generally accepted fundamentals and methodologies of traffic and transportation theory: a brief review ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ Solving traffic queues at controlled-signalized intersections in continuous-time Markov games ⋮ A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem ⋮ Dynamic vehicle routing with time windows in theory and practice
Uses Software
Cites Work
- Unnamed Item
- Transportation systems analysis. Models and applications.
- Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models
- A meta-heuristic approach for solving the urban network design problem
- Optimization of Area Traffic Control for Equilibrium Network Flows
- Traffic Equilibrium with Responsive Traffic Control
- A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
- Multidimensional Stochastic Approximation Methods
This page was built for publication: An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem