Neural Deconstruction Search for Vehicle Routing Problems
Autoregressive construction approaches generate solutions to vehicle routing problems in a step-by-step fashion, leading to high-quality solutions that are nearing the performance achieved by handcrafted, operations research techniques. In this work, we challenge the conventional paradigm of sequential solution construction and introduce an iterative search framework where solutions are instead deconstructed by a neural policy. Throughout the search, the neural policy collaborates with a simple greedy insertion algorithm to rebuild the deconstructed solutions. Our approach surpasses the performance of state-of-the-art operations research methods across three challenging vehicle routing problems of various problem sizes.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A review of approaches to modeling applied vehicle routing problems
Due to the practical importance of vehicle routing problems (VRP), there exists an ever-growing body of research in algorithms and (meta)heuristics for solving such problems. However, the diversity of VRP domains creates…
DiversityvalidLearning Vehicle Routing Problems using Policy Optimisation
Deep reinforcement learning (DRL) has been used to learn effective heuristics for solving complex combinatorial optimisation problem via policy networks and have demonstrated promising performance. Existing works have fo…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)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 NetworkNeural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuristics on routing problems has been steadi…
BIG-bench Machine LearningMulti-Agent Environments for Vehicle Routing Problems
Research on Reinforcement Learning (RL) approaches for discrete optimization problems has increased considerably, extending RL to an area classically dominated by Operations Research (OR). Vehicle routing problems are a …
Benchmarkingreinforcement-learningReinforcement LearningReinforcement Learning (RL)