A metaheuristic for vehicle routing problems based on reinforcement learning
暂无分享,去创建一个
[1] David Meignan,et al. Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism , 2010, J. Heuristics.
[2] Pierre Hansen,et al. Variable neighborhood search , 1997, Eur. J. Oper. Res..
[3] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[4] Richard F. Hartl,et al. Adaptive search techniques for problems in vehicle routing, Part I: A survey , 2015 .
[5] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[6] Hermann Gehring,et al. A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .
[7] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[8] G. Lewicki,et al. Approximation by Superpositions of a Sigmoidal Function , 2003 .
[9] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[10] Alex Graves,et al. Asynchronous Methods for Deep Reinforcement Learning , 2016, ICML.
[11] Toshihide Ibaraki,et al. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..
[12] David Silver,et al. Deep Reinforcement Learning with Double Q-Learning , 2015, AAAI.
[13] William A. Kirk,et al. A FIXED POINT THEOREM FOR ASYMPTOTICALLY NONEXPANSIVE MAPPINGS , 1972 .
[14] Le Song,et al. 2 Common Formulation for Greedy Algorithms on Graphs , 2018 .
[15] Le Song,et al. Discriminative Embeddings of Latent Variable Models for Structured Data , 2016, ICML.
[16] Peter Stone,et al. Deep Recurrent Q-Learning for Partially Observable MDPs , 2015, AAAI Fall Symposia.
[17] R Bellman,et al. On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.
[18] Geir Hasle,et al. Industrial Vehicle Routing , 2007, Geometric Modelling, Numerical Simulation, and Optimization.
[19] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[20] Jaime Cerdá,et al. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows , 2007, Eur. J. Oper. Res..
[21] Marcin Andrychowicz,et al. Learning to learn by gradient descent by gradient descent , 2016, NIPS.
[22] Bruce L. Golden,et al. A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..
[23] Michel Gendreau,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..
[24] Daniele Vigo,et al. An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..
[25] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[26] Michel Gendreau,et al. Solving small VRPTWs with Constraint Programming Based Column Generation , 2022 .
[27] Roberto Montemanni,et al. Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..
[28] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[29] David Pisinger,et al. A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..
[30] Shalabh Bhatnagar,et al. Incremental Natural Actor-Critic Algorithms , 2007, NIPS.
[31] Michel Gendreau,et al. Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..
[32] Tom Schaul,et al. Prioritized Experience Replay , 2015, ICLR.
[33] Michel Gendreau,et al. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..
[34] Guy Desaulniers,et al. The Vehicle Routing Problem with Time Windows , 2014, Vehicle Routing.
[35] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..
[36] Sebastian Thrun,et al. Issues in Using Function Approximation for Reinforcement Learning , 1999 .
[37] Puca Huachi Vaz Penna,et al. An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem , 2013, J. Heuristics.
[38] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[39] Yoshua Bengio,et al. Understanding the difficulty of training deep feedforward neural networks , 2010, AISTATS.
[40] Nysret Musliu,et al. Feature Extractors for Describing Vehicle Routing Problem Instances , 2016, SCOR.
[41] Kevin Leyton-Brown,et al. Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.