A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints
暂无分享,去创建一个
[1] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[2] Anjali Awasthi,et al. A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints , 2017, Int. J. Prod. Res..
[3] Reinaldo Morabito,et al. An optimization model for the vehicle routing problem with practical three-dimensional loading constraints , 2013, Int. Trans. Oper. Res..
[4] Michel Gendreau,et al. Solving the hub location problem in a star–star network , 2008 .
[5] Eduardo C. Xavier,et al. A branch-and-cut approach for the vehicle routing problem with loading constraints , 2016, Expert Syst. Appl..
[6] Daniele Vigo,et al. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..
[7] Cláudio Alves,et al. Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints , 2015, ICCSA.
[8] Cláudio Alves,et al. Exact Algorithms for Vehicle Routing Problems with Different Service Constraints. , 2009 .
[9] Michel Gendreau,et al. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.