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

Результат исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференции

1 Downloads (Pure)

Выдержка

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.

Язык оригиналаанглийский
Название основной публикацииProceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018
РедакторыSergey Balandin, Timo Hamalainen, Tatiana Tyutina
ИздательInstitute of Electrical and Electronics Engineers Inc.
Страницы173-178
Число страниц6
ISBN (электронное издание)9789526865348
DOI
СостояниеОпубликовано - 19 сен 2018
Событие22nd Conference of Open Innovations Association FRUCT, FRUCT 2018 - Jyvaskyla, Финляндия
Продолжительность: 15 мая 201818 мая 2018

Серия публикаций

НазваниеConference of Open Innovation Association, FRUCT
Том2018-May
ISSN (печатное издание)2305-7254

Конференция

Конференция22nd Conference of Open Innovations Association FRUCT, FRUCT 2018
СтранаФинляндия
ГородJyvaskyla
Период15/05/1818/05/18

Отпечаток

Vehicle routing
Travel time
Planning

Предметные области Scopus

  • Компьютерные науки (все)
  • Электротехника и электроника

Цитировать

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. В S. Balandin, T. Hamalainen, & T. Tyutina (Ред.), Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018 (стр. 173-178). [8468273] (Conference of Open Innovation Association, FRUCT; Том 2018-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/FRUCT.2018.8468273
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. редактор / Sergey Balandin ; Timo Hamalainen ; Tatiana Tyutina. Institute of Electrical and Electronics Engineers Inc., 2018. стр. 173-178 (Conference of Open Innovation Association, FRUCT).
@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 = "9",
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",

}

Mugayskikh, AV, Zakharov, VV & Tuovinen, T 2018, Time-dependent multiple depot vehicle routing problem on megapolis network under wardrop's traffic flow assignment. в S Balandin, T Hamalainen & T Tyutina (ред.), Proceedings of the 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018., 8468273, Conference of Open Innovation Association, FRUCT, том. 2018-May, Institute of Electrical and Electronics Engineers Inc., стр. 173-178, Jyvaskyla, Финляндия, 15/05/18. https://doi.org/10.23919/FRUCT.2018.8468273

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. ред. / Sergey Balandin; Timo Hamalainen; Tatiana Tyutina. Institute of Electrical and Electronics Engineers Inc., 2018. стр. 173-178 8468273 (Conference of Open Innovation Association, FRUCT; Том 2018-May).

Результат исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференции

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.

ER -

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