The multiple vehicle routing problem with simultaneous delivery and pick-up points
作者： Hokey Min
DOI: 10.1016/0191-2607(89)90085-X
关键词:
摘要: … public library distribution system in Franklin County, … trucks of equal capacity, we select a level that represents the specific number of clusters tantamount to the number of available trucks…
elsevier.com
sci-hub.se 参考文章(10)
Lawrence D. Bodin, A taxonomic structure for vehicle routing and scheduling problems Computers & Urban Society. ,vol. 1, pp. 11- 29 ,(1975) , 10.1016/0305-7097(75)90003-4
H. Charles Romesburg, Cluster analysis for researchers ,(1984)
Leonard W. Schruben, Ruth E. Clifton, The Lockset Method of Sequential Programming Applied to Routing Delivery and Pickup Trucks American Journal of Agricultural Economics. ,vol. 50, pp. 854- 867 ,(1968) , 10.2307/1237623
Harilaos N. Psaraftis, A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem Transportation Science. ,vol. 14, pp. 130- 154 ,(1980) , 10.1287/TRSC.14.2.130
B. Golden, M. Ball, L. Bodin, Current and future research directions in network optimization Computers & Operations Research. ,vol. 8, pp. 71- 81 ,(1981) , 10.1016/0305-0548(81)90035-6
Don T. Phillips, Alberto Garcia-Diaz, Fundamentals of Network Analysis ,(1981)
C. D. J. Waters, G. P. Brodie, Realistic Sizes for Routeing Problems Journal of the Operational Research Society. ,vol. 38, pp. 565- 566 ,(1987) , 10.1057/JORS.1987.97
G. Clarke, J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points Operations Research. ,vol. 12, pp. 568- 581 ,(1964) , 10.1287/OPRE.12.4.568
Michael R. Anderberg, Cluster Analysis for Applications ,(1973)
Dura W. Sweeney, Katta G. Murty, John D. C. Little, Caroline Karel, An Algorithm for the Traveling Salesman Problem ,(2019)