Standard

Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization. / Krylatov, Alexander Yu. ; Shirokolobova, Anastasiya P. .

EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization. ed. / H.C. Rodrigues; J. Herskovits; at al. Cham : Springer Nature, 2019. p. 61-69.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Krylatov, AY & Shirokolobova, AP 2019, Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization. in HC Rodrigues, J Herskovits & at al. (eds), EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization. Springer Nature, Cham, pp. 61-69, 6th International Conference on Engineering Optimization, Лиссабон, Portugal, 17/09/18. https://doi.org/10.1007/978-3-319-97773-7_6

APA

Krylatov, A. Y., & Shirokolobova, A. P. (2019). Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization. In H. C. Rodrigues, J. Herskovits, & at al. (Eds.), EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization (pp. 61-69). Springer Nature. https://doi.org/10.1007/978-3-319-97773-7_6

Vancouver

Krylatov AY, Shirokolobova AP. Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization. In Rodrigues HC, Herskovits J, at al., editors, EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization. Cham: Springer Nature. 2019. p. 61-69 https://doi.org/10.1007/978-3-319-97773-7_6

Author

Krylatov, Alexander Yu. ; Shirokolobova, Anastasiya P. . / Network’s Trip Demand Estimation as a Problem of Combinatorial Optimization. EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization. editor / H.C. Rodrigues ; J. Herskovits ; at al. Cham : Springer Nature, 2019. pp. 61-69

BibTeX

@inproceedings{cb3fa67f2b7a4a40820ac19c227c0ee6,
title = "Network{\textquoteright}s Trip Demand Estimation as a Problem of Combinatorial Optimization",
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.",
keywords = "Combinatorial optimization, Trip demand estimation, OD-matrix estimation, Network equilibrium problem",
author = "Krylatov, {Alexander Yu.} and Shirokolobova, {Anastasiya P.}",
year = "2019",
doi = "10.1007/978-3-319-97773-7_6",
language = "English",
isbn = "978-3-319-97772-0",
pages = "61--69",
editor = "Rodrigues, {H.C. } and Herskovits, {J. } and {at al.}",
booktitle = "EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization",
publisher = "Springer Nature",
address = "Germany",
note = "6th International Conference on Engineering Optimization, EngOpt2018 ; Conference date: 17-09-2018 Through 19-09-2018",

}

RIS

TY - GEN

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

AU - Krylatov, Alexander Yu.

AU - Shirokolobova, Anastasiya P.

N1 - Conference code: 6

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Combinatorial optimization

KW - Trip demand estimation

KW - OD-matrix estimation

KW - Network equilibrium problem

U2 - 10.1007/978-3-319-97773-7_6

DO - 10.1007/978-3-319-97773-7_6

M3 - Conference contribution

SN - 978-3-319-97772-0

SP - 61

EP - 69

BT - EngOpt 2018 Proceedings of the 6th International Conference on Engineering Optimization

A2 - Rodrigues, H.C.

A2 - Herskovits, J.

A2 - at al.,

PB - Springer Nature

CY - Cham

T2 - 6th International Conference on Engineering Optimization

Y2 - 17 September 2018 through 19 September 2018

ER -

ID: 48925884