Show simple item record

dc.contributor.authorMugayskikh, Alexander V.
dc.contributor.authorZakharov, Victor V.
dc.contributor.authorTuovinen, Tero
dc.contributor.editorBaladin, Sergey
dc.contributor.editorHämäläinen, Timo
dc.contributor.editorTyutina, Tatiana
dc.date.accessioned2019-01-04T06:47:16Z
dc.date.available2019-01-04T06:47:16Z
dc.date.issued2018
dc.identifier.citationMugayskikh, 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. Baladin, T. Hämäläinen, & T. Tyutina (Eds.), <i>FRUCT : Proceedings of the 22nd Conference of Open Innovations Association</i> (pp. 173-178). IEEE. Proceedings of Conference of Open Innovations Association FRUCT. <a href="https://doi.org/10.23919/FRUCT.2018.8468273" target="_blank">https://doi.org/10.23919/FRUCT.2018.8468273</a>
dc.identifier.otherCONVID_28282860
dc.identifier.otherTUTKAID_78951
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/60880
dc.description.abstractIn 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.en
dc.format.extent426
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherIEEE
dc.relation.ispartofFRUCT : Proceedings of the 22nd Conference of Open Innovations Association
dc.relation.ispartofseriesProceedings of Conference of Open Innovations Association FRUCT
dc.relation.urihttps://fruct.org/publications/fruct22/files/Mug.pdf
dc.rightsCC BY-ND 4.0
dc.subject.othervehicle routing
dc.subject.otherbiological system modeling
dc.subject.otheroptimization
dc.subject.otherplanning
dc.titleTime-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
dc.typeconferenceObject
dc.identifier.urnURN:NBN:fi:jyu-201901031025
dc.contributor.laitosInformaatioteknologian tiedekuntafi
dc.contributor.laitosFaculty of Information Technologyen
dc.contributor.oppiaineTietotekniikkafi
dc.contributor.oppiaineMathematical Information Technologyen
dc.type.urihttp://purl.org/eprint/type/ConferencePaper
dc.date.updated2019-01-03T10:15:15Z
dc.relation.isbn978-952-68653-4-8
dc.description.reviewstatuspeerReviewed
dc.format.pagerange173-178
dc.relation.issn2305-7254
dc.type.versionpublishedVersion
dc.rights.copyright© 2018, IEEE.
dc.rights.accesslevelopenAccessfi
dc.relation.conferenceConference of Open Innovations Association
dc.relation.grantnumber298788
dc.relation.grantnumber311036
dc.subject.ysoreititys
dc.subject.ysosuunnittelu
dc.subject.ysotiet
dc.subject.ysooptimointi
dc.format.contentfulltext
jyx.subject.urihttp://www.yso.fi/onto/yso/p23476
jyx.subject.urihttp://www.yso.fi/onto/yso/p1377
jyx.subject.urihttp://www.yso.fi/onto/yso/p1210
jyx.subject.urihttp://www.yso.fi/onto/yso/p13477
dc.rights.urlhttps://creativecommons.org/licenses/by-nd/4.0/
dc.relation.doi10.23919/FRUCT.2018.8468273
dc.relation.funderSuomen Akatemiafi
dc.relation.funderSuomen Akatemiafi
dc.relation.funderAcademy of Finlanden
dc.relation.funderAcademy of Finlanden
jyx.fundingprogramTutkijaliikkuvuusrahoitus, SAfi
jyx.fundingprogramTutkijaliikkuvuusrahoitus, SAfi
jyx.fundingprogramResearcher mobility Funding, AoFen
jyx.fundingprogramResearcher mobility Funding, AoFen
jyx.fundinginformationThis research was supported by the Academy of Finland (grants n:o 298788 and n:o 311036).


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

CC BY-ND 4.0
Except where otherwise noted, this item's license is described as CC BY-ND 4.0