Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives
Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically
designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing …
designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing …
Machine learning to solve vehicle routing problems: A survey
A Bogyrbayeva, M Meraliyev… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
This paper provides a systematic overview of machine learning methods applied to solve NP-
hard Vehicle Routing Problems (VRPs). Recently, there has been great interest from both …
hard Vehicle Routing Problems (VRPs). Recently, there has been great interest from both …
Learning for multiple purposes: A Q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problem
In recent years, combining the artificial intelligence techniques with traditional operations
research approaches for solving combinatorial optimization problems is an interesting issue …
research approaches for solving combinatorial optimization problems is an interesting issue …
A strategy based on wave swarm for the formation task inspired by the traveling salesman problem
RD Lamperti, LVR de Arruda - Engineering Applications of Artificial …, 2023 - Elsevier
Multi-robots can perform complex tasks such as exploration, foraging, and formation.
Efficient communication between robots can contribute to the accomplishment of collective …
Efficient communication between robots can contribute to the accomplishment of collective …
A new method for improving the fairness of multi-robot task allocation by balancing the distribution of tasks
This paper presents an innovative task allocation method for multi-robot systems that aims to
optimize task distribution while taking into account various performance metrics such as …
optimize task distribution while taking into account various performance metrics such as …
Reinforcement learning for the traveling salesman problem: Performance comparison of three algorithms
J Wang, C Xiao, S Wang, Y Ruan - The Journal of Engineering, 2023 - Wiley Online Library
Travelling salesman problem (TSP) is one of the most famous problems in graph theory, as
well as one of the typical nondeterministic polynomial time (NP)‐hard problems in …
well as one of the typical nondeterministic polynomial time (NP)‐hard problems in …
Learning-based simulated annealing algorithm for unequal area facility layout problem
J Lin, A Shen, L Wu, Y Zhong - Soft Computing, 2024 - Springer
This paper proposes a learning-based simulated annealing (LSA) algorithm to tackle the NP-
hard unequal area facility layout problem (UA-FLP). The goal of UA-FLP is to optimize the …
hard unequal area facility layout problem (UA-FLP). The goal of UA-FLP is to optimize the …
Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem
Many real-world problems can be formulated as a constrained Traveling Salesman Problem
(TSP). However, the constraints are always complex and numerous, making the TSPs …
(TSP). However, the constraints are always complex and numerous, making the TSPs …
A Scalable and Adaptable Supervised Learning Approach for Solving the Traveling Salesman Problems
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem
that has attracted extensive research efforts in developing exact methods and heuristics …
that has attracted extensive research efforts in developing exact methods and heuristics …
NeuralGLS: learning to guide local search with graph convolutional network for the traveling salesman problem
J Sui, S Ding, B Xia, R Liu, D Bu - Neural Computing and Applications, 2024 - Springer
The traveling salesman problem (TSP) aims to find the shortest tour that visits each node of
a given graph exactly once. TSPs have significant importance as numerous practical …
a given graph exactly once. TSPs have significant importance as numerous practical …