Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
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. Baladin, T. Hämäläinen, & T. Tyutina (Eds.), FRUCT : Proceedings of the 22nd Conference of Open Innovations Association (pp. 173-178). IEEE. Proceedings of Conference of Open Innovations Association FRUCT. https://doi.org/10.23919/FRUCT.2018.8468273
© 2018, IEEE.
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.
Parent publication ISBN978-952-68653-4-8
ConferenceConference of Open Innovations Association
Is part of publicationFRUCT : Proceedings of the 22nd Conference of Open Innovations Association
Publication in research information system
MetadataShow full item record
Related funder(s)Academy of Finland
Funding program(s)Researcher mobility Funding, AoF
Additional information about fundingThis research was supported by the Academy of Finland (grants n:o 298788 and n:o 311036).
Showing items with similar title or keywords.
Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems Kärkkäinen, Tommi; Rasku, Jussi (Springer, 2020)Vehicle Routing Problems (VRP) are computationally challenging, constrained optimization problems, which have central role in logistics management. Usually different solvers are being developed and applied for different ...
Rasku, Jussi; Musliu, Nysret; Kärkkäinen, Tommi (Springer, 2019)Many of the algorithms for solving vehicle routing problems expose parameters that strongly influence the quality of obtained solutions and the performance of the algorithm. Finding good values for these parameters is a ...
Mian, Isfandyar Khan (2020)Vehicle routing optimization and container loading combined would produce millions of queries for the remaining capacity of the vehicles. In this situation, these approximate methods for finding the remaining capacity of ...
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization Nguyen, Hung Khanh; Zhang, Yanru; Chang, Zheng; Han, Zhu (Institute of Electrical and Electronics Engineers, 2017)Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless ...
Application of time-dependent many-body perturbation theory to excitation spectra of selected finite model systems Säkkinen, Niko (University of Jyväskylä, 2016)In this thesis, an approximate method introduced to solve time-dependent many-body problems known as time-dependent many-body perturbation theory is studied. Many-body perturbation theory for interacting electrons and ...