Standard

Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. / Mugayskikh, Alexander V.; Zakharov, Victor V.; Tuovinen, Tero.

Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018. ed. / Sergey Balandin; Timo Hamalainen; Tatiana Tyutina. Institute of Electrical and Electronics Engineers Inc., 2018. p. 173-178 8468273 (Conference of Open Innovation Association, FRUCT; Vol. 2018-May).

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

Harvard

Mugayskikh, AV, Zakharov, VV & Tuovinen, T 2018, Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. in S Balandin, T Hamalainen & T Tyutina (eds), Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018., 8468273, Conference of Open Innovation Association, FRUCT, vol. 2018-May, Institute of Electrical and Electronics Engineers Inc., pp. 173-178, 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018, Jyvaskyla, Finland, 15/05/18. https://doi.org/10.23919/FRUCT.2018.8468273

APA

Mugayskikh, A. V., Zakharov, V. V., & Tuovinen, T. (2018). Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. In S. Balandin, T. Hamalainen, & T. Tyutina (Eds.), Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018 (pp. 173-178). [8468273] (Conference of Open Innovation Association, FRUCT; Vol. 2018-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/FRUCT.2018.8468273

Vancouver

Mugayskikh AV, Zakharov VV, Tuovinen T. Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. In Balandin S, Hamalainen T, Tyutina T, editors, Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 173-178. 8468273. (Conference of Open Innovation Association, FRUCT). https://doi.org/10.23919/FRUCT.2018.8468273

Author

Mugayskikh, Alexander V. ; Zakharov, Victor V. ; Tuovinen, Tero. / Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018. editor / Sergey Balandin ; Timo Hamalainen ; Tatiana Tyutina. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 173-178 (Conference of Open Innovation Association, FRUCT).

BibTeX

@inproceedings{e21632aff46c402fb88c869cc8cdedc8,
title = "Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment",
abstract = "In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into account traffic flow information can reduce route time by 8-37% depending on number of customers in the problem instance.",
author = "Mugayskikh, {Alexander V.} and Zakharov, {Victor V.} and Tero Tuovinen",
year = "2018",
month = sep,
day = "19",
doi = "10.23919/FRUCT.2018.8468273",
language = "English",
series = "Conference of Open Innovation Association, FRUCT",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "173--178",
editor = "Sergey Balandin and Timo Hamalainen and Tatiana Tyutina",
booktitle = "Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018",
address = "United States",
note = "22nd Conference of Open Innovations Association FRUCT, FRUCT 2018 ; Conference date: 15-05-2018 Through 18-05-2018",

}

RIS

TY - GEN

T1 - Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment

AU - Mugayskikh, Alexander V.

AU - Zakharov, Victor V.

AU - Tuovinen, Tero

PY - 2018/9/19

Y1 - 2018/9/19

N2 - In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into account traffic flow information can reduce route time by 8-37% depending on number of customers in the problem instance.

AB - In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into account traffic flow information can reduce route time by 8-37% depending on number of customers in the problem instance.

UR - http://www.scopus.com/inward/record.url?scp=85055553448&partnerID=8YFLogxK

U2 - 10.23919/FRUCT.2018.8468273

DO - 10.23919/FRUCT.2018.8468273

M3 - Conference contribution

AN - SCOPUS:85055553448

T3 - Conference of Open Innovation Association, FRUCT

SP - 173

EP - 178

BT - Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018

A2 - Balandin, Sergey

A2 - Hamalainen, Timo

A2 - Tyutina, Tatiana

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018

Y2 - 15 May 2018 through 18 May 2018

ER -

ID: 35487702