Study on the One-Commodity Pickup-and-Delivery Vehicle Routing Problem
暂无分享,去创建一个
[1] A. Lim,et al. The one-commodity pickup and delivery travelling salesman problem on a path or a tree , 2006 .
[2] Juan José Salazar González,et al. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..
[3] Hokey Min,et al. The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .
[4] Juan-José Salazar-González,et al. The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .
[5] Goran Martinović,et al. Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service , 2008 .
[6] Willem Jan van Hoeve,et al. Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches , 2010, CPAIOR.
[7] Penny L. Holborn,et al. Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows , 2012, EvoCOP.
[8] Inmaculada Rodríguez Martín,et al. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..
[9] Roberto Baldacci,et al. An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.
[10] Michel Gendreau,et al. Mathematical formulations for a 1-full-truckload pickup-and-delivery problem , 2015, Eur. J. Oper. Res..
[11] Fanggeng Zhao,et al. Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Ind. Eng..
[12] George M. Giaglis,et al. Minimizing logistics risk through real‐time vehicle routing and mobile technologies: Research to date and future trends , 2004 .