Name
Title | ||
|---|---|---|
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints |
Abstract | ||
|---|---|---|
•In this paper we propose a new model that is a compromise between minimizing the average arc congestion and the worst arc congestion on the road network.•The model is a linear program that minimizes the average arc congestion over a given percentage of the most congested arcs.•A heuristic algorithm aimed at reducing the number of paths that are considered for the model is also proposed. A computational study is performed that shows the flexibility of the model and the quality of the heuristic.•Computational experiments show that the proposed heuristic reduces by orders of magnitude the number of generated paths and, consequently, by orders of magnitude the amount of memory usage and computational time, while allowing high quality solutions of the model. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.05.028 | Computers & Operations Research |
Keywords | Field | DocType |
Traffic assignment,Congestion,Linear programming,CVaR | Mathematical optimization,Heuristic,Road networks,Arc (geometry),Heuristic (computer science),Minification,Linear programming,Travel time,Mathematics,Bounded function | Journal |
Volume | ISSN | Citations |
110 | 0305-0548 | 2 |
PageRank | References | Authors |
0.46 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrico Angelelli | 1 | 291 | 20.58 |
| V. Morandi | 2 | 3 | 1.23 |
| Maria Grazia Speranza | 3 | 1217 | 77.86 |