Multiple Pickup and Delivery TSP with LIFO and Distance Constraints: A VNS Approach
暂无分享,去创建一个
Andrew Lim | Xiang Gao | Wenbin Zhu | Hu Qin
[1] Shaul P. Ladany,et al. OPTIMAL ROUTING OF A SINGLE VEHICLE WITH LOADING AND UNLOADING CONSTRAINTS , 1984 .
[2] Michel Gendreau,et al. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..
[3] Manuel Iori,et al. Heuristic and exact algorithms for the multi-pile vehicle routing problem , 2011, OR Spectr..
[4] G. Laporte,et al. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010 .
[5] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[6] Gilbert Laporte,et al. Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..
[7] Gregorio Tirado,et al. The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..
[8] Andrew Lim,et al. The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading , 2010, AAAI.
[9] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Stochastic Demand and Duration Constraints , 2010, Transp. Sci..
[10] Chung-Lun Li,et al. On the Distance Constrained Vehicle Routing Problem , 1992, Oper. Res..
[11] Gregory Levitin,et al. Optimal routing of multiple-load AGV subject to LIFO loading constraints , 2003, Comput. Oper. Res..