A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
暂无分享,去创建一个
[1] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[2] José-Manuel Belenguer,et al. A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..
[3] Moshe Dror,et al. A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..
[4] Moshe Dror,et al. Vehicle routing with split deliveries , 1994, Discret. Appl. Math..
[5] Moshe Dror,et al. Savings by Split Delivery Routing , 1989, Transp. Sci..
[6] Gerard Sierksma,et al. Routing helicopters for crew exchanges on off-shore locations , 1998, Ann. Oper. Res..
[7] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[8] M. Grazia Speranza. The split delivery vehicle routing problem , 2006 .
[9] M. Dror,et al. Split delivery routing , 1990 .
[10] Moshe Dror,et al. Split-delivery routeing heuristics in livestock feed distribution , 1997 .
[11] J. W. Giffin,et al. The split delivery vehicle scheduling problem with time windows and grid network distances , 1995, Comput. Oper. Res..
[12] Frederick J. Gilman,et al. A lower bound on ‖ε’/ε‖ , 1983 .
[13] Gilbert Laporte,et al. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..
[14] Maria Grazia Speranza,et al. Complexity and Reducibility of the Skip Delivery Problem , 2005, Transp. Sci..
[15] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .