LaT is proposed, a plug-and-play training paradigm that uses a pretrained large language model as an external trainer that improves the solution quality of several state-of-the-art multi-task neural solvers on both trained and unseen variants, supporting the effectiveness and generality of the proposed training paradigm.
Abstract
Multi-task neural solvers aim to handle multiple Vehicle Routing Problem (VRP) variants within a unified model, avoiding separate training for each constraint combination. However, VRP variants differ in optimization difficulty, while existing methods lack stage-wise feedback on their training status, making the model biased to some specific variants. Although meta-learning can support adaptive training, it typically requires bi-level optimization and additional gradient updates, increasing computational cost. To address this limitation, we propose LLM-as-Trainer (LaT), a plug-and-play training paradigm that uses a pretrained large language model as an external trainer. LaT periodically analyzes cross-task validation metrics to generate a stage-wise guidance vector. This vector is combined with the current task's constraint vector and injected into each encoder layer, providing the neural solver with additional training information during subsequent policy optimization. Experiments on 16 VRP variants show that LaT improves the solution quality of several state-of-the-art multi-task neural solvers on both trained and unseen variants, supporting the effectiveness and generality of the proposed training paradigm.
The experimental results demonstrate that RLEA outperforms the previous state-of-the-ar method, achieving a 16.67% higher success rate while significantly reducing runtime errors, and validate that integrating reinforcement learning with LLM-based reasoning is highly effective for automated optimization modeling.
Yi Chen, Zi-Pei Yu, Jia-Hai Wang et al.· 1 citation
This work introduces an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions, which are then further optimized by a genetic algorithm, enabling real-time and interactive routing at scale.
Ido Greenberg, P. Sielski, Hugo Linsenmaier et al.· Communications AI & Computin...· 1 citation
The proposed hierarchical multi-agent proximal policy optimization framework can reduce total airlines' operational costs—including direct operating cost and capital cost and achieves a computation speedup in comparison with a conventional optimization baseline.
Li-Jing Liu, James M. Shihua, Qi-Yu Yan et al.· MATEC Web of Conferences· 0 citations
This work proposes Preference Optimization with Locally Augmented Refinement with Locally Augmented Refinement (POLAR), a novel training algorithm that applies a local search refinement pass to the best decoded tour before forming preference pairs, yielding much more informative pairwise margins.
Arthur Corrêa, P. Nascimento, Samuel Moniz· 0 citations
Deep Policy Dynamic Programming is proposed, which aims to combine the strengths of learned neural heuristics with those of DP algorithms, and prioritizes and restricts the DP state space using a policy derived from a deep neural network, which is trained to predict edges from example solutions.
W. Kool, H. van Hoof, J. Gromicho et al.· 0 citations
These findings demonstrate that reinforcement learning is a promising and scalable alternative to conventional heuristic and metaheuristic approaches for capacitated routing problems, particularly in dynamic logistics environments that require rapid and adaptive decision making.
Audrey Ariij Sya'imaa.HS, Hilda Azkiyah, Khandker Farid Uddin Ahmed· International Journal of Mat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.