Vehicle Routing Problem

doi:doi:10.57702/46hz02kq

Vehicle Routing Problem

The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and returns to the starting node.

BibTex:

@dataset{Bharathan_Balaji_and_Jordan_Bell-Masterson_and_Enes_Bilgin_and_Andreas_Damianou_and_Pablo_Moreno_Garcia_and_Arpit_Jain_and_Runfei_Luo_and_Alvaro_Maggiar_and_Balakrishnan_Narayanaswamy_and_Chun_Ye_2024,
    abstract = {The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and returns to the starting node.},
    author = {Bharathan Balaji and Jordan Bell-Masterson and Enes Bilgin and Andreas Damianou and Pablo Moreno Garcia and Arpit Jain and Runfei Luo and Alvaro Maggiar and Balakrishnan Narayanaswamy and Chun Ye},
    doi = {10.57702/46hz02kq},
    institution = {No Organization},
    keyword = {'Combinatorial Optimization', 'Machine Learning', 'Reinforcement Learning', 'Vehicle Routing Problem'},
    month = {dec},
    publisher = {TIB},
    title = {Vehicle Routing Problem},
    url = {https://service.tib.eu/ldmservice/dataset/vehicle-routing-problem},
    year = {2024}
}