A universal framework for vehicle routing problems with large language models

DOI10.1007/S40305-026-00692-6MaRDI QIDQ7355250zbMATH OpenFDO

Authors Ruibin Zeng, Moxuan Yang, Minglong Lei, Lingfeng Niu, Yuhong Dai

Publication date 22 September 2026

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-026-00692-6

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• A branch and bound algorithm for the capacitated vehicle routing problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A genetic algorithm for the vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An algorithm for the traveling salesman problem with pickup and delivery customers
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Deep policy dynamic programming for vehicle routing problems
• Neural networks and physical systems with emergent collective computational abilities
• The General Pickup and Delivery Problem
• The vehicle routing problem

This page was built for publication: A universal framework for vehicle routing problems with large language models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355250)