Learning heuristics for the TSP by policy gradient
From MaRDI portal
Publication:1626725
DOI10.1007/978-3-319-93031-2_12OpenAlexW2805798351MaRDI QIDQ1626725
Alexandre Lacoste, Michel Deudon, Yossiri Adulyasak, Pierre Cournut, Louis-Martin Rousseau
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_12
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (14)
Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Learning the travelling salesperson problem requires rethinking generalization ⋮ A reinforcement learning approach to the orienteering problem with time windows ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ Guidelines for the computational testing of machine learning approaches to vehicle routing problems ⋮ Predicting the optimal period for Cyclic Hoist Scheduling Problems ⋮ The first AI4TSP competition: learning to solve stochastic routing problems ⋮ Adaptive solution prediction for combinatorial optimization ⋮ Learn and route: learning implicit preferences for vehicle routing ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Research on improved ant colony optimization for traveling salesman problem ⋮ Generalization of machine learning for problem reduction: a case study on travelling salesman problems ⋮ Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems ⋮ Neural large neighborhood search for routing problems
This page was built for publication: Learning heuristics for the TSP by policy gradient
