A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function

Botte, Marilisa; Gallo, Mariano; Marinelli, Mario; D’Acierno, Luca

doi:10.3390/app10165698

Submit to this Journal Review for this Journal Edit a Special Issue

Article Menu

...

Open AccessArticle

A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function

^1,*

and

Department of Civil, Architectural and Environmental Engineering, Federico II University of Naples, Via Claudio 21, 80125 Naples, Italy

Department of Engineering, University of Sannio, Piazza Roma 21, 82100 Benevento, Italy

Author to whom correspondence should be addressed.

Appl. Sci. 2020, 10(16), 5698; https://doi.org/10.3390/app10165698

Received: 17 July 2020 / Revised: 10 August 2020 / Accepted: 11 August 2020 / Published: 17 August 2020

(This article belongs to the Special Issue Mathematical Methods, Models and Algorithms for Smart, Sustainable and Secure Mobility)

View Full-Text Download PDF

Browse Figures

Citation Export

Abstract

In this paper, we propose a generalisation of the Method of Successive Averages (MSA) for solving traffic assignment problems. The generalisation consists in proposing a different step sequence within the general MSA framework to reduce computing times. The proposed step sequence is based on the modification of the classic 1/k sequence for improving the convergence speed of the algorithm. The reduction in computing times is useful if the assignment problems are subroutines of algorithms for solving Network Design Problems—such algorithms require estimation of the equilibrium traffic flows at each iteration, hence, many thousands of times for real-scale cases. The proposed algorithm is tested with different parameter values and compared with the classic MSA algorithm on a small and on two real-scale networks. A test inside a Network Design Problem is also reported. Numerical results show that the proposed algorithm outperforms the classic MSA with reductions in computing times, reaching up to 79%. Finally, the theoretical properties are studied for stating the convergence of the proposed algorithm. View Full-Text

Keywords: traffic assignment; MSA algorithm; fixed-point problems; network design

▼ Show Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share and Cite

MDPI and ACS Style

Botte, M.; Gallo, M.; Marinelli, M.; D’Acierno, L. A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function. Appl. Sci. 2020, 10, 5698. https://doi.org/10.3390/app10165698

AMA Style

Botte M, Gallo M, Marinelli M, D’Acierno L. A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function. Applied Sciences. 2020; 10(16):5698. https://doi.org/10.3390/app10165698

Chicago/Turabian Style

Botte, Marilisa, Mariano Gallo, Mario Marinelli, and Luca D’Acierno. 2020. "A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function" Applied Sciences 10, no. 16: 5698. https://doi.org/10.3390/app10165698

Find Other Styles

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Abstract views Pdf views Html views

Article Menu

A Methodology for Increasing Convergence Speed of Traffic Assignment Algorithms Based on the Use of a Generalised Averaging Function

Abstract

Share and Cite

Article Metrics

Article Access Statistics

Article Access Map by Country/Region

Further Information

Guidelines

MDPI Initiatives

Follow MDPI