Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › Рецензирование
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.
T2 - 22nd Conference of Open Innovations Association FRUCT, FRUCT 2018
Y2 - 15 May 2018 through 18 May 2018
ER -
ID: 35487702