Neural Networks for Vehicle Routing Problem

László Kovács, Ali Jlidi
9/17/2024
cs.AI

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

The Vehicle Routing Problem is about optimizing the routes of vehicles to meet the needs of customers at specific locations. The route graph consists of depots on several levels and customer positions. Several optimization methods have been developed over the years, most of which are based on some type of classic heuristic: genetic algorithm, simulated annealing, tabu search, ant colony optimization, firefly algorithm. Recent developments in machine learning provide a new toolset, the rich family of neural networks, for tackling complex problems. The main area of application of neural networks is the area of classification and regression. Route optimization can be viewed as a new challenge for neural networks. The article first presents an analysis of the applicability of neural network tools, then a novel graphical neural network model is presented in detail. The efficiency analysis based on test experiments shows the applicability of the proposed NN architecture.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kovcs2024neural,
  title  = {Neural Networks for Vehicle Routing Problem},
  author = {László Kovács and Ali Jlidi},
  year   = {2024},
  eprint = {2409.11290},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.11290v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.11290.svg)](https://codeofpaper.com/paper/2409.11290)

Discussion