Neural Networks for Vehicle Routing Problem
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems
When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), w…
Graph Neural NetworkLearning a Transferable Scheduling Policy for Various Vehicle Routing Problems based on Graph-centric Representation Learning
Reinforcement learning has been used to learn to solve various routing problems. however, most of the algorithm is restricted to finding an optimal routing strategy for only a single vehicle. In addition, the trained pol…
Graph Neural Networkreinforcement-learningReinforcement LearningReinforcement Learning (RL)+2Variable Neighborhood Search for the Electric Vehicle Routing Problem
The Electric Vehicle Routing Problem (EVRP) extends the classical Vehicle Routing Problem (VRP) to reflect the growing use of electric and hybrid vehicles in logistics. Due to the variety of constraints considered in the…
Vehicle Routing with Finite Time Horizon using Deep Reinforcement Learning with Improved Network Embedding
In this paper, we study the vehicle routing problem with a finite time horizon. In this routing problem, the objective is to maximize the number of customer requests served within a finite time horizon. We present a nove…
Reinforcement LearningAn Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles
Reinforcement learning has recently shown promise in learning quality solutions in a number of combinatorial optimization problems. In particular, the attention-based encoder-decoder models show high effectiveness on var…
Combinatorial OptimizationComputational EfficiencyDecoderTraveling Salesman Problem