Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems
Kärkkäinen, T., & Rasku, J. (2020). Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems. In P. Diez, P. Neittaanmäki, J. Periaux, T. Tuovinen, & J. Pons-Prats (Eds.), Computation and Big Data for Transport : Digital Innovations in Surface and Air Transport Systems (pp. 77-102). Springer. Computational Methods in Applied Sciences, 54. https://doi.org/10.1007/978-3-030-37752-6_6
Published inComputational Methods in Applied Sciences
© 2020, Springer Nature Switzerland AG
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 kind of problems. However, if descriptive and general features could be extracted to describe such problems and their solution attempts, then one could apply data mining and machine learning methods in order to discover general knowledge on such problems. The aim then would be to improve understanding of the most important characteristics of VRPs from both efficient solution and utilization points of view. The purpose of this article is to address these challenges by proposing a novel feature analysis and knowledge discovery process for Capacitated Vehicle Routing problems (CVRP). Results of knowledge discovery allow us to draw interesting conclusions from relevant characteristics of CVRPs.
Parent publication ISBN978-3-030-37751-9
Is part of publicationComputation and Big Data for Transport : Digital Innovations in Surface and Air Transport Systems
Publication in research information system
MetadataShow full item record
Showing items with similar title or keywords.
Pechenizkiy, Mykola (University of Jyväskylä, 2005)Tiedon louhinnalla pyritään paljastamaan tietokannasta tietomassaan sisältyviä säännönmukaisuuksia, joiden olemassaolosta ei vielä olla tietoisia. Kun tietokantaan sisältyvät tiedot ovat kovin moniulotteisia, yksittäisten ...
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 ...
Rasku, Jussi; Kärkkäinen, Tommi; Musliu, Nysret (Dagstuhl Publishing, 2016)The vehicle routing problem comes in varied forms. In addition to usual variants with diverse constraints and specialized objectives, the problem instances themselves – even from a single shared source - can be distinctly ...
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 ...
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment Mugayskikh, Alexander V.; Zakharov, Victor V.; Tuovinen, Tero (IEEE, 2018)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 ...