Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization

Research outputpeer-review

Abstract

The paper is devoted to the problem of trip demand estimation in a road network. Commonly, when solving trip demand estimation problem researchers suppose the presence of so-called a prior origin-destination matrix. Unlike such an approach we assume that the only input data for trip demand estimation problem is traffic load on arcs. Thus, in this paper we intend to avoid using a prior origin-destination matrix for trip demand estimation and show that in such a case one is faced with the problem of combinatorial optimization. Computational complexity of appeared problem is discussed. Heuristic procedure for solving the problem is proposed and it is applied to the test example.
Original languageEnglish
Title of host publicationEngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization
EditorsH.C. Rodrigues, J. Herskovits, at al.
Place of PublicationCham
PublisherSpringer Nature
Pages61-69
Number of pages9
ISBN (Electronic)978-3-319-97773-7
ISBN (Print)978-3-319-97772-0
DOIs
Publication statusPublished - 2019
Event6th International Conference on Engineering Optimization - Лиссабон
Duration: 17 Sep 201819 Sep 2018
Conference number: 6

Conference

Conference6th International Conference on Engineering Optimization
Abbreviated titleEngOpt2018
CountryPortugal
CityЛиссабон
Period17/09/1819/09/18

Fingerprint Dive into the research topics of 'Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization'. Together they form a unique fingerprint.

Cite this