Vehicle Routing with Finite Time Horizon using Deep Reinforcement Learning with Improved Network Embedding

• URL: http://arxiv.org/abs/2601.15131v1
• Date: Wed, 21 Jan 2026 16:05:04 GMT
• Title: Vehicle Routing with Finite Time Horizon using Deep Reinforcement Learning with Improved Network Embedding
• Authors: Ayan Maity, Sudeshna Sarkar,
• Abstract summary: We present a novel routing network embedding module which creates local node embedding vectors and a context-aware global graph representation.<n>We integrate our embedding module with a policy gradient-based deep Reinforcement Learning framework to solve the vehicle routing problem with finite time horizon.<n>Our experimental results show that our method achieves a higher customer service rate than the existing routing methods.
• Score: 1.8641099267622092
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 novel routing network embedding module which creates local node embedding vectors and a context-aware global graph representation. The proposed Markov decision process for the vehicle routing problem incorporates the node features, the network adjacency matrix and the edge features as components of the state space. We incorporate the remaining finite time horizon into the network embedding module to provide a proper routing context to the embedding module. We integrate our embedding module with a policy gradient-based deep Reinforcement Learning framework to solve the vehicle routing problem with finite time horizon. We trained and validated our proposed routing method on real-world routing networks, as well as synthetically generated Euclidean networks. Our experimental results show that our method achieves a higher customer service rate than the existing routing methods. Additionally, the solution time of our method is significantly lower than that of the existing methods.

Related papers

• Can Neural Networks Provide Latent Embeddings for Telemetry-Aware Greedy Routing? [22.04675077514561]
  We propose emphPlacer, a novel algorithm using Message Passing Networks to transform network states into latent node embeddings.<n>These embeddings facilitate quick greedy next-hop routing without directly solving the all-pairs shortest paths problem.
  arXiv  Detail & Related papers  (2026-02-13T10:31:09Z)
• URoadNet: Dual Sparse Attentive U-Net for Multiscale Road Network Extraction [35.39993205110938]
  We introduce a computationally efficient and powerful framework for elegant road-aware segmentation.<n>Our method, called URoadNet, effectively encodes fine-grained local road connectivity and holistic global topological semantics.<n>Our approach represents a significant advancement in the field of road network extraction.
  arXiv  Detail & Related papers  (2024-12-23T13:45:29Z)
• Neural Semantic Map-Learning for Autonomous Vehicles [85.8425492858912]
  We present a mapping system that fuses local submaps gathered from a fleet of vehicles at a central instance to produce a coherent map of the road environment. Our method jointly aligns and merges the noisy and incomplete local submaps using a scene-specific Neural Signed Distance Field. We leverage memory-efficient sparse feature-grids to scale to large areas and introduce a confidence score to model uncertainty in scene reconstruction.
  arXiv  Detail & Related papers  (2024-10-10T10:10:03Z)
• Robust Path Selection in Software-defined WANs using Deep Reinforcement Learning [18.586260468459386]
  We propose a data-driven algorithm that does the path selection in the network considering the overhead of route computation and path updates. Our scheme fares well by a factor of 40% with respect to reducing link utilization compared to traditional TE schemes such as ECMP.
  arXiv  Detail & Related papers  (2022-12-21T16:08:47Z)
• Deep Reinforcement Learning Aided Packet-Routing For Aeronautical Ad-Hoc Networks Formed by Passenger Planes [99.54065757867554]
  We invoke deep reinforcement learning for routing in AANETs aiming at minimizing the end-to-end (E2E) delay. A deep Q-network (DQN) is conceived for capturing the relationship between the optimal routing decision and the local geographic information observed by the forwarding node. We further exploit the knowledge concerning the system's dynamics by using a deep value network (DVN) conceived with a feedback mechanism.
  arXiv  Detail & Related papers  (2021-10-28T14:18:56Z)
• Deep Learning Aided Packet Routing in Aeronautical Ad-Hoc Networks Relying on Real Flight Data: From Single-Objective to Near-Pareto Multi-Objective Optimization [79.96177511319713]
  We invoke deep learning (DL) to assist routing in aeronautical ad-hoc networks (AANETs) A deep neural network (DNN) is conceived for mapping the local geographic information observed by the forwarding node into the information required for determining the optimal next hop. We extend the DL-aided routing algorithm to a multi-objective scenario, where we aim for simultaneously minimizing the delay, maximizing the path capacity, and maximizing the path lifetime.
  arXiv  Detail & Related papers  (2021-10-28T14:18:22Z)
• Road Network Guided Fine-Grained Urban Traffic Flow Inference [108.64631590347352]
  Accurate inference of fine-grained traffic flow from coarse-grained one is an emerging yet crucial problem. We propose a novel Road-Aware Traffic Flow Magnifier (RATFM) that exploits the prior knowledge of road networks. Our method can generate high-quality fine-grained traffic flow maps.
  arXiv  Detail & Related papers  (2021-09-29T07:51:49Z)
• Relational Deep Reinforcement Learning for Routing in Wireless Networks [2.997420836766863]
  We develop a distributed routing strategy based on deep reinforcement learning that generalizes to diverse traffic patterns, congestion levels, network connectivity, and link dynamics. Our algorithm outperforms shortest path and backpressure routing with respect to packets delivered and delay per packet.
  arXiv  Detail & Related papers  (2020-12-31T16:28:21Z)
• Convolutional Recurrent Network for Road Boundary Extraction [99.55522995570063]
  We tackle the problem of drivable road boundary extraction from LiDAR and camera imagery. We design a structured model where a fully convolutional network obtains deep features encoding the location and direction of road boundaries. We showcase the effectiveness of our method on a large North American city where we obtain perfect topology of road boundaries 99.3% of the time.
  arXiv  Detail & Related papers  (2020-12-21T18:59:12Z)
• Constructing Geographic and Long-term Temporal Graph for Traffic Forecasting [88.5550074808201]
  We propose Geographic and Long term Temporal Graph Convolutional Recurrent Neural Network (GLT-GCRNN) for traffic forecasting. In this work, we propose a novel framework for traffic forecasting that learns the rich interactions between roads sharing similar geographic or longterm temporal patterns.
  arXiv  Detail & Related papers  (2020-04-23T03:50:46Z)
• DeepTransport: Learning Spatial-Temporal Dependency for Traffic Condition Forecasting [31.65583737358249]
  We propose an end-to-end framework called DeepTransport to predict traffic conditions. CNN and RNN are utilized to obtain spatial-temporal traffic information within a transport network topology. We constructed and released a real-world large traffic condition dataset with a 5-minute resolution.
  arXiv  Detail & Related papers  (2017-09-27T15:39:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.