Abstract

The present paper is devoted to travel time equilibration procedure for solving traffic assignment problem with respect to route flows. We prove that equilibrium route-flow assignment can be easily obtained by implementing equilibration procedure together with simple rules for sequential extension and/or by reducing the set of active routes. Accurate route-flow solution for the small Sioux Falls network is found via the developed algorithm and demonstrates some important points related with visualization issues, decision making support and scenario analysis in the sphere of transportation planning.

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers
EditorsIlias S. Kotsireas, Panos M. Pardalos
PublisherSpringer Nature
Pages68-79
Number of pages12
ISBN (Print)9783030535513
DOIs
Publication statusPublished - 2020
Event14th International Conference on Learning and Intelligent Optimization, LION 2020 - Athens
Duration: 24 May 202028 May 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12096 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Learning and Intelligent Optimization, LION 2020
CountryGreece
CityAthens
Period24/05/2028/05/20

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Travel times equilibration procedure for route-flow traffic assignment problem'. Together they form a unique fingerprint.

Cite this