Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems
Kärkkäinen, Tommi; Rasku, Jussi (2020). Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems. In Diez, Pedro; Neittaanmäki, Pekka; Periaux, Jacques; Tuovinen, Tero; Pons-Prats, Jordi (Eds.) Computation and Big Data for Transport : Digital Innovations in Surface and Air Transport Systems (pp. 77-102). Computational Methods in Applied Sciences, 54. Cham: Springer. DOI: 10.1007/978-3-030-37752-6_6
Published inComputational Methods in Applied Sciences
Embargoed until: 2022-03-01Request copy from author
© 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.