A generic exact solver for vehicle routing and related problems
暂无分享,去创建一个
Ruslan Sadykov | Artur Alves Pessoa | François Vanderbeck | Eduardo Uchoa | Eduardo Uchoa | A. Pessoa | F. Vanderbeck | R. Sadykov | François Vanderbeck
[1] Guy Desaulniers,et al. New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows , 2016, INFORMS J. Comput..
[2] Stefan Irnich. Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..
[3] Roberto Roberti,et al. Dynamic ng-Path Relaxation for the Delivery Man Problem , 2014, Transp. Sci..
[4] José-Manuel Belenguer,et al. The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..
[5] Stefan Irnich,et al. Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling , 2010, INFORMS J. Comput..
[6] Eduardo Uchoa,et al. Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm , 2019, Transp. Sci..
[7] M. Balinski,et al. On an Integer Program for a Delivery Problem , 1964 .
[8] Robert M. Nauss,et al. Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach , 2003, INFORMS J. Comput..
[9] Jacques A. Ferland,et al. An exact method with variable fixing for solving the generalized assignment problem , 2012, Comput. Optim. Appl..
[10] Ruslan Sadykov,et al. A branch-and-price algorithm for the Minimum Latency Problem , 2018, Comput. Oper. Res..
[11] Axel Parmentier,et al. Algorithms for non-linear and stochastic resource constrained shortest path , 2015, Mathematical Methods of Operations Research.
[12] Maria Grazia Speranza,et al. A branch-and-cut algorithm for the Team Orienteering Problem , 2018, Int. Trans. Oper. Res..
[13] Marcus Poggi de Aragão,et al. Limited memory Rank-1 Cuts for Vehicle Routing Problems , 2017, Oper. Res. Lett..
[14] Cláudio Alves,et al. Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints , 2017, Eur. J. Oper. Res..
[15] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[16] Stefan Irnich,et al. Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems , 2018, Eur. J. Oper. Res..
[17] Toby Walsh,et al. Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .
[18] Stefan Irnich,et al. Stabilized branch-and-price algorithms for vector packing problems , 2018, Eur. J. Oper. Res..
[19] Ruslan Sadykov,et al. Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation , 2018, INFORMS J. Comput..
[20] Andrew Lim,et al. A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.
[21] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[22] M. P. Aragão,et al. Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms , 2003 .
[23] Roberto Baldacci,et al. An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..
[24] Sylvie Gélinas,et al. A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..
[25] David Pisinger,et al. Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows , 2008 .
[26] Manuel Iori,et al. Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..
[27] Roberto Roberti,et al. New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..
[28] Thibaut Vidal,et al. New benchmark instances for the Capacitated Vehicle Routing Problem , 2017, Eur. J. Oper. Res..
[29] Bruce L. Golden,et al. The team orienteering problem , 1996 .
[30] Gleb Belov,et al. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..
[31] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[32] Marcus Poggi de Aragão,et al. Improved branch-cut-and-price for capacitated vehicle routing , 2016, Mathematical Programming Computation.
[33] Richard W. Eglese,et al. Efficient Routeing for Winter Gritting , 1992 .
[34] Ruslan Sadykov,et al. Primal Heuristics for Branch and Price: The Assets of Diving Methods , 2019, INFORMS J. Comput..
[35] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[36] Jörg Homberger,et al. Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows , 2002, J. Heuristics.
[37] David Pisinger,et al. Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..
[38] Brian Kallehauge,et al. Lagrangian duality applied to the vehicle routing problem with time windows , 2006, Comput. Oper. Res..
[39] Artur Alves Pessoa,et al. A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing , 2020, Transp. Sci..
[41] William J. Cook,et al. Maximum-weight stable sets and safe lower bounds for graph coloring , 2012, Mathematical Programming Computation.
[42] Nicos Christofides,et al. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..
[43] Manuel Iori,et al. Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems , 2020, INFORMS J. Comput..
[44] Rafael Martinelli,et al. A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..
[45] Jacques Desrosiers,et al. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .
[46] Fábio Protti,et al. On the complete set packing and set partitioning polytopes: Properties and rank 1 facets , 2018, Oper. Res. Lett..
[47] Marcus Poggi de Aragão,et al. Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..
[48] Roberto Baldacci,et al. A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..
[49] Maria Grazia Speranza,et al. Optimal solutions for routing problems with profits , 2013, Discret. Appl. Math..
[50] George L. Nemhauser,et al. An abstract model for branching and its application to mixed integer programming , 2015, Math. Program..
[51] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[52] Paolo Toth,et al. Lower bounds and algorithms for the 2-dimensional vector packing problem , 2001, Discret. Appl. Math..
[53] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[54] Guy Desaulniers,et al. Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..
[55] Andrew Lim,et al. A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems , 2020, INFORMS J. Comput..
[56] G. Laporte,et al. A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.
[57] Laurence A. Wolsey,et al. Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.
[58] Thibaut Vidal,et al. The vehicle routing problem with service level constraints , 2017, Eur. J. Oper. Res..
[59] Gilbert Laporte,et al. Improved lower bounds and exact algorithm for the capacitated arc routing problem , 2013, Math. Program..
[60] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[61] Pasquale Avella,et al. A computational study of exact knapsack separation for the generalized assignment problem , 2010, Comput. Optim. Appl..
[62] Giovanni Righini,et al. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..
[63] João Pedro Pedroso,et al. Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..
[64] G. Laporte,et al. A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .
[65] Renato F. Werneck,et al. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..
[66] Iain Dunning,et al. JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..
[67] Ruslan Sadykov,et al. Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems , 2018, Eur. J. Oper. Res..
[68] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[69] Alain Hertz,et al. The capacitated team orienteering and profitable tour problems , 2007, J. Oper. Res. Soc..
[70] Stefan Irnich,et al. Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem , 2012, Oper. Res..
[71] Duc-Cuong Dang,et al. Solving the team orienteering problem with cutting planes , 2016, Comput. Oper. Res..
[72] Ruslan Sadykov,et al. A generic exact solver for vehicle routing and related problems , 2020, Math. Program..
[73] David Pisinger,et al. A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..
[74] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[75] Nicos Christofides,et al. The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.